Only Stacy is added to Names in the array, wiping Matt in the process.
To fix this replace the following code
with
Oh, also, note that the $dat[level], etc, WILL generate warnings, and should be
more correctly written as $dat['level'].
The other thing I thought I should point out is that the array keys when
created using xml_parse_into_struct will be an UPPERCASE version of your
existing element names. If case is important, especially if you, like me, need
mixedCase, do the following:
===============================================================================
$simple = '
Alanine
ala
A
hydrophobic
Lysine
lys
K
charged
';
$p = xml_parser_create();
xml_parse_into_struct($p, $simple, $vals, $index);
xml_parser_free($p);
echo "";
echo "Index array\n";
print_r($index);
echo "\nVals array\n";
print_r($vals);
foreach ($vals as $k => $v) {
$i = 0;
if (trim($v['value']) != '') {
if ($arr[$i][$v['tag']] != '') {
$i ++;
}
$arr[$i][$v['tag']] = $v['value'];
}
}
===============================================================================
Sorry.. unreachable and unneeded code in my posting above :-)
Here is the fixed version:
function xml_condense_tree($tree) {
if ($tree["children"]) {
unset($nodecounters);
foreach ($tree['children'] as $index => $node) {
if (!isset($nodecounters[$node['tag']]))
$nodecounters[$node['tag']]=1;
else $nodecounters[$node['tag']]++;
}
foreach ($tree['children'] as $index => $node) {
if (isset($node['children'])) {
$tree['children'][$index] = xml_condense_tree($node);
} elseif (isset($node['value']) and !$node['attributes'] and
$nodecounters[$node['tag']]==1) {
$tree['values'][$node['tag']] = $node['value'];
unset($tree['children'][$index]);
}
}
}
if (!$tree['children']) unset($tree['children']);
return $tree;
}
===============================================================================
I needed something a bit different:
this is the result of my xml2array function (from the moldb example)
Array
(
[molecule] => Array
(
[0] => Array
(
[name] => Alanine
[symbol] => ala
[code] => A
[type] => hydrophobic
)
[1] => Array
(
[name] => Lysine
[symbol] => lys
[code] => K
[type] => charged
)
)
)
function xml2array($data)
{
//mvo<EMAIL_ADDRESS>//original ripped from on the<EMAIL_ADDRESS>//to be used for data retrieval(result-structure is Data oriented)
$p = xml_parser_create();
xml_parser_set_option($p, XML_OPTION_SKIP_WHITE, 1);
xml_parse_into_struct($p, $data, &$vals, &$index);
xml_parser_free($p);
$tree = array();
$i = 0;
//array_push($tree, array('tag' => $vals[$i]['tag'], 'attributes'=> $vals
[$i]['attributes'], 'children' => ));
$tree = GetChildren($vals, $i);
return $tree;
}
function GetChildren($vals, &$i)
{
$children = array();
if ($vals[$i]['value']) array_push($children, $vals[$i]['value']);
$prevtag = "";
while (++$i < count($vals)) // so pra nao botar while true ;-)
{
switch ($vals[$i]['type'])
{
case 'cdata':
array_push($children, $vals[$i]['value']);
break;
case 'complete':
$children[ strtolower($vals[$i]['tag']) ] = $vals[$i]['value'];
break;
case 'open':
//restartindex on unique tag-name
$j++;
if ($prevtag <> $vals[$i]['tag']) {
$j = 0;
$prevtag = $vals[$i]['tag'];
}
$children[ strtolower($vals[$i]['tag']) ][$j] = GetChildren
($vals,$i);
break;
case 'close':
return $children;
}
}
}
===============================================================================
I wrote this function in a bad mood, to get some data you can loop through.
sprint_r or var_dump its output to see what it does. It's not pretty, but at
least you can loop through the data without a LOT of hassle.
This can also be done with handlers, but I couldn't be bothered with global
variables.
path = "\$this->result";
$this->index = 0;
$xml_parser = xml_parser_create($encoding);
xml_set_object($xml_parser, &$this);
xml_set_element_handler($xml_parser, 'startElement', 'endElement');
xml_set_character_data_handler($xml_parser, 'characterData');
xml_parse($xml_parser, $data, true);
xml_parser_free($xml_parser);
}
function startElement($parser, $tag, $attributeList) {
$this->path .= "->".$tag;
eval("\$data = ".$this->path.";");
if (is_array($data)) {
$index = sizeof($data);
$this->path .= "[".$index."]";
} else if (is_object($data)) {
eval($this->path." = array(".$this->path.");");
$this->path .= "[1]";
}
foreach($attributeList as $name => $value)
eval($this->path."->".$name. " = '".XMLParser::cleanString($value).
"';");
}
function endElement($parser, $tag) {
$this->path = substr($this->path, 0, strrpos($this->path, "->"));
}
function characterData($parser, $data) {
if (strlen($data = XMLParser::cleanString($data)))
eval($this->path." = '$data';");
}
}
?>
===============================================================================
@wickedfather, re: beaudurrant....I just cannot concur that the latter's class
is "great"....First of all, it doesn't handle attributes. Second of all, as my
code below demonstrates, there is no need waste processing by determining
duplicates within their own loop. Thirdly, when there are duplicates, it
collapses the layer in the array above the duplicates.
Here is some much more consise code, though not (yet) object oriented, and also
not yet handling attributes; it maintains a stack for each level:
$pop['children']));
}
}
$prevLevel[sizeof($prevLevel)-1] = $parent;
}
}
?>
===============================================================================
This is a great little function for a lot of XML work, but note that this
function does not handle XML entities properly.
The basic XML entities < > & " are fine, just anything else will
not work:
If the entity is defined in the XML header, the parser will drop it completely
from the struct it creates.
If the entity is not defined in the XML then the parser will crash out with an
undefined entity error.
You should be able to work around this limitation by using a preg_replace on
your XML string before passing it to the parser.
(Further details in Bug #35271; this is just a warning to those thinking of
using this function for parsing real XML documents not just trivial XML
examples)
===============================================================================
Thanx to jukea i've upgraded the characterData-function to allow the value 0.
Here is the new complete code:
path = "\$this->result";
$this->index = 0;
$xml_parser = xml_parser_create($encoding);
xml_set_object($xml_parser, &$this);
xml_set_element_handler($xml_parser, 'startElement', 'endElement');
xml_set_character_data_handler($xml_parser, 'characterData');
xml_parse($xml_parser, $data, true);
xml_parser_free($xml_parser);
}
function startElement($parser, $tag, $attributeList) {
$this->path .= "->".$tag;
eval("\$data = ".$this->path.";");
if (is_array($data)) {
$index = sizeof($data);
$this->path .= "[".$index."]";
} else if (is_object($data)) {
eval($this->path." = array(".$this->path.");");
$this->path .= "[1]";
}
foreach($attributeList as $name => $value)
eval($this->path."->".$name. " = '".XMLParser::cleanString($value).
"';");
}
function endElement($parser, $tag) {
$this->path = substr($this->path, 0, strrpos($this->path, "->"));
}
function characterData($parser, $data) {
if (strlen($data = XMLParser::cleanString($data)))
eval($this->path." = '$data';");
}
}
?>


AP Top Entertainment News at 1:17 a.m. EST
by EndPlayN. Scott Momaday remembers 1969 Pulitzer, promises memoir
Rosalía marks historic night for women at Latin Grammys
Swift says AMAs performance in jeopardy over music dispute
Pierce Brosnan's sons named Golden Globe Awards ambassadors
Nielsen says 13.8 million watched impeachment hearing
Mo'Nique sues Netflix for discrimination in show offer
Tense TV: CNN's Blitzer asks Kellyanne Conway about husband
Trump Jr.'s book is a No. 1 bestseller, but with an edge
California's Huntington Library gets rare slavery documents
Despite female push, Garth Brooks bests Underwood at CMAs


Index of /dtd/nlm-3.0/xmlchars
Parent Directory
isogrk1.ent
isogrk2.ent
isogrk4.ent
Apache/2.2 Server at ej.iop.org Port 80


The accordion widget shows and hides content for a given header element, similar to tabs.
It works with a number of DOM markups as long as there is a header/content consistency. This accordion is configurable for either horizontal or vertical styles.
An accordion doesn't allow more than one content panel to be open at the same time.
new can.ui.Accordion($('#demo1'));
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
new can.ui.Accordion($('#demo2'), { fillSpace: true });
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
new can.ui.Accordion($('#demo3'), { dir: "horizontal" });
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
new can.ui.Accordion($('#demo4'), { dir: "horizontal", fillSpace: true });
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
lorem ipsum dolor....
| Name | type | default | description |
|---|---|---|---|
| active | Selector, Element, jQuery, Boolean | ':first' | The active/open element by default. Set to false to display none at start. |
| dir | 'vertical' or 'horizontal' | 'vertical' | The direction to which the accordion will be expanding/collapsing. |
| fillSpace | Boolean | false | Determines whether the accordion completely fills the dimension based on the 'dir' option of the parent element or not. |
| header | Selector | ':header' | The element to be the toggler. |
| disabled | Boolean | false | Enables/Disables the accordion from expanding/collapsing. |
Occurs when an item is 'activated'. Currently only supports 'click' but should add 'hover'.


1-Week Intro Offer
A full week of unlimited classes and open play!
$30
Get it now & start any time!
Sign up for our newsletter to receive updates about new classes, promotions, workshops and events!


Synchronisation period
Synchronise from the last
days
Sync
MXR Organization Meeting Time Tracker v1.0


Atlanta:
Well, at the very least, there will be an explosion in the north wing! At the worst, the same thing could happen again that happened the last time...
when then project, "Arrival of the Eternal Spring" was thwarted... So, if the Flames of Pa'agrio were to explode again...
Eternal Winter will consume these ruins once more!
"What can I do to help?"


Toggle navigation
Admin
Edit Teams
Manage Relationships
Edit Deaths
Edit Rounds
Random Assignment
Control


{% extends 'base.html' %} {% block title %} Students {% endblock %} {% block content %}
| first name | Middle Name | Last Name | Age | Gender | Date of Birth | Department | Faculty | {{ student.first_name }} | {{ student.middle_name }} | {{ student.last_name }} | {{ student.age }} | {{ student.gender }} | {{ student.date_of_birth }} | {{ student.department }} | {{ student.faculty }} |
|---|


Mike is a student at UC San Diego, where he is a graduating senior majoring in Computer Science and Engineering. He previously interned at Workday as a Test Automation Engineer, where he led automation efforts in several scrum teams, spread automation knowledge to full time employees and interns, and contributed much needed automation code.


{% extends "aristotle_mdr/static/about_base.html" %} {% block title %}About: Workgroups{% endblock %} {% block item_name %}Workgroups{% endblock %} {% block breadcrumbs %}
A workgroup is an administrative collection of people working together to create a set of metadata for a specific purpose.
Every item belongs to a workgroup, and this workgroup is used to determine the permissions around when and to whom an item is visible. However, once an item is registered it become the property of the registry, rather than just the workgroup.
Workgroups usually have one or more registration authorities associated with them, and the workgroup is presumed to be creating content on behalf of these registraion authorities. If a workgroup has no registration authority associated with it registration of items is not possible and items will be visible only to members of the workgroup and cannot be "standardised".
{% endblock %}


Name :-
Email :-
Phone number :-
Message :-


import errno
import os
import shutil
import sys
from pathlib import Path
from traceback import print_exc
from IPython.core.getipython import get_ipython
from IPython.core.profiledir import ProfileDir
from IPython.terminal.embed import InteractiveShellEmbed
from IPython.terminal.ipapp import TerminalIPythonApp
from traitlets.config import Bool, Unicode, observe
from traitlets.traitlets import TraitError
[docs]class ProfileDirError(Exception):
pass
[docs]class ReprProfileDir(ProfileDir):
"""An object to manage the profile directory and its resources.
The profile directory is used by all IPython applications, to manage
configuration, logging and security.
This object knows how to find, create and manage these directories. This
should be used by any code that wants to handle profiles.
Notes
-----
Implements `__fspath__` to implement the pathlib protocol.
"""
[docs] def __init__(self, **kwargs):
"""Create an init and then make it way shorter."""
super().__init__(**kwargs)
self.ensure_dir_exists = DirectoryChecker
# startup_dir = Unicode("startup")
# log_dir = Unicode("log")
location = Unicode(
help="""Set the profile location directly. This overrides the logic used by the
`profile` option.""",
allow_none=True,
).tag(
config=True
) # noqa
# don't set the location more than once no matter how many profiles
# are instantiated so yes a class attr
_location_isset = False
def __repr__(self):
"""I'll admit this is unnecessary. Oh well."""
return "{}: {}".format(self.__class__.__name__, self.location)
def _mkdir(self, path, mode=0o755):
"""Override the superclasses mkdir."""
try:
Path(path).mkdir()
except OSError as e:
if e.errno == errno.EEXIST:
return False
else:
raise
def __fspath__(self):
return str(self.location)
@observe("location")
def _location_changed(self, change):
"""This is so odd to me. What is change when does it get called?
Raises
------
TraitError
No longer raises RuntimeError because that's insane
"""
if self._location_isset:
raise TraitError("Cannot set profile location more than once.")
self._location_isset = True
new = change["new"]
self.ensure_dir_exists()
# what is static?
for i in ["security", "log", "startup", "pid", "static"]:
self.ensure_dir_exists()
[docs]class DirectoryChecker:
"""Checks for the presence of needed directories and creates them."""
[docs] def __init__(self, *args):
"""Initialize with optional needed dirs."""
self.fs = Path
self.initialize()
[docs] @property
def shell(self):
"""Return the global IPython instance."""
return get_ipython()
[docs] def initialize(self):
"""Initialize with a modified version of the IPython shell."""
if self.shell.initialized():
# Running inside IPython
# Detect if embed shell or not and display a message
if isinstance(self.shell, InteractiveShellEmbed):
sys.stderr.write(
"\nYou are currently in an embedded IPython shell,\n"
"the configuration will not be loaded.\n\n"
)
else:
# Not inside IPython
# Build a terminal app in order to force ipython to load the configuration
ipapp = TerminalIPythonApp()
# Avoid output (banner, prints)
ipapp.interact = False
[docs] def ensure_dir_exists(self, path, mode=0o755):
"""Ensure that a directory exists.
If it doesn't exist, try to create it and protect against a race
condition if another process is doing the same.
The default permissions are :data:`0o755`, which differ from
:func:`os.makedirs()` default of :data:`0o777`.
Parameters
----------
path : str (path-like)
Path to the directory
mode : int
If the directory doesn't exist, what mode should it be created as?
Returns
-------
None
Raises
------
OSError, IOError
"""
if not hasattr(folder, "exists"):
folder = self.fs(folder)
if not folder.exists():
try:
folder.mkdir()
except PermissionError:
return errno.EPERM
except FileExistsError:
raise
except IsADirectoryError:
raise
[docs] def initialize_profile(self):
"""Initialize the profile but sidestep the IPython.core.ProfileDir().
The class searches for directories named default_profile and if found
uses that as a profile which I dislike.
"""
profile_to_load = self.fs("~/.ipython/default_profile").expanduser()
try:
self.ensure_dir_exists(profile_to_load)
except OSError as e:
print_exc(e)
else:
self.shell.profile_dir = os.path.expanduser("~/.ipython/default_profile")


Lindsay Lohan Pays Tribute to Her Ex and 'Best Friend' Harry Morton After Shocking Death
by Zach SeemayerLindsay Lohan is remembering her friend and former boyfriend, Harry Morton.
One day after Morton's untimely death, Lohan took to Instagram to share a tribute to her ex -- whom she briefly but famously dated in 2006.
Lohan posted a touching black-and-white snapshot showing her and Morton, dressed to the nines and holding hands at the 63rd International Venice Film Festival in September 2006, smiling for the cameras.
"Best friends. Best life," Lohan emotionally captioned the tribute.
Morton, the 38-year-old founder of the Pink Taco restaurant chain, was found dead in his Beverly Hills home on Saturday afternoon, a spokesperson for the Beverly Hills Police Department confirmed to ET.
A source familiar with the situation tells ET that Morton was discovered by his younger brother, Matthew.
The Beverly Hills Police Department spokesperson said there was no evidence of foul play and an autopsy report is pending.
Morton is the son of business tycoon Peter Morton, the co-founder of Hard Rock Cafe and Hotels, and the grandson of Arnie Morton, founder of Morton’s The Steakhouse.
In addition to starting Pink Taco, which has locations in Los Angeles, Chicago, Boston and Las Vegas, he also once owned the Viper Room nightclub in West Hollywood and is an investor in Beacher’s Madhouse.
Aside from Lohan, Morton was also romantically linked throughout the years to several other stars including Paris Hilton and Britney Spears.


News, Reviews and Discussion of EEStor Inc.
Logged in as admin | Last visit 15 hours ago
Start a New Topic Search Admin Logout
TEST TEST TEST
Online: admin, tvillars
Newest User: mrjerry
Powered by El Dorado | æ


I'm Tracey Lum, a designer and developer with a passion for problem solving and technology.
I'm currently based in Boston pursuing a degree in Computer Science & Interactive Media at Northeastern University.
This site is still being worked on. Come back soon for more fun! In the mean time check out some of my work on GitHub, or drop me a line here.


http://farlight.org/index.html?type=shellcode
http://shell-storm.org/shellcode
/
http://www.windowsexploits.com/ (dead) |
Archive as of 13 Feb 2016


Portfolio
Design
I can come up with cool ideas
Develop
I can make my cool idea reality
Mobile
My Cool idea works on little screens!
Business Centric
I can look clean and professional (For a fee)
I can come up with cool ideas
I can make my cool idea reality
My Cool idea works on little screens!
I can look clean and professional (For a fee)


BY EDWIN JAHIEL
THE OBJECT OF MY AFFECTION (1998) ** 1/2 Directed by Nicholas Hytner.Written by Wendy Wasserstein, based on the novel by Stephen McCauley. Photography, Oliver Stapleton. Editing, Tariq Anwar. Production design, Jane Musky. Music, George Fenton. Cast: Paul Rudd (George Hanson), Jennifer Aniston (Nina Borowski), Alan Alda (Sidney Miller), Allison Janney (Constance Miller), Tim Daly (Dr. Robert Joley), John Pankow (Vince McBride), Nigel Hawthorne (Rodney Fraser),Amo Gulinello (Paul James), Steve Zahn (Frank Hanson), et al. A 20th Century Fox release. 110 minutes. R (sex, language)
The object of my affection can change my complexion from white to rosy red Anytime she holds my hand, tells me that she's mine There are many girls who can thrill me and some who can fill me with dreams of happiness But I know I'll never rest until she says she's mine ...........................
The title "The Object Of My Affection," is familiar to connoisseurs of old pop music, from the eponymous song of long ago. The movie's sound-track, pleasant and mercifully not as busy as most, includes a few nice oldies, notably the 1929 "You Were Meant for Me," performed twice, by Sting and by Gene Kelly. But surprise! "The Object..." is, sadly, nowhere to be heard.
A good semi-surprise is that the film's several gay men are portrayed in anti-"La Cage aux Folles"ways. The gays are treated in a straight fashion: no special traits, intonations, mannerisms, flamboyance, queenly demeanor and the like. Just people. In fact, ordinary beings. But then, ordinary people can often be uninteresting too, and that's the main rub in this movie.
George, a New Yorker like most others in the cast, teaches first grade in a posh, private school. He gets dumped by college professor and would-be writer Robert Joley, his companion for four years. Helpfully, Nina, who counsels teen-age girls, places at George's disposal a room in her apartment. The two become fast friends, "fast" meaning both quickly and strongly.
Nina's boyfriend Vince, a civil rights lawyer and occasionally her colleague, seems to be a decent fellow, but eventually the couple comes to a parting of the ways, somehow catalyzed unwillingly by George's presence and Nina's ever-growing affection for him, an acute state of mutual loving friendship. This almost climaxes when Nina starts initiating sexual relations. Perhaps, at this point, the story could become "A Bisexual is Born," (or reborn) but the odd couple is saved by the bell, that of a ringing telephone.
When Nina finds out that she pregnant by Vince, she decides to raise the child with George. It looks like a good plan, until George, after a long period of uninvolvement with other men, meets Paul, an actor who lives with much older Rodney, a Brit in New York .
Rodney gets rather little screen time, but Nigel Hawthorne plays him beautifully: as a theater critic with a bite, and as an aging man who loses his lover. He does it with admirable economy, wit, wisdom, contained fatalism and pathos. After the movie is forgotten, Hawthorne will not be. The actor is reunited here with director Nicholas Hytner, the British stage person whose film debut was "The Madness of King George."
The other supporting roles, all very peripheral, range from tiny to sub-sketchy, with semi-caricatures reserved for such as senior citizens taking ballroom dancing lessons, and especially for a funny Alan Alda ("the most powerful literary agent in the world") and his current wife. She is also Nina's older stepsister and self-appointed matchmaker. Recurring bits of a daft older lady on the ground floor of Nina's building are blatant padding.
The main performances (Nina's and George's appealing duo; Vince's uncertainly written part) are pretty good, but missing in strong personalities. There's a lack of energy all over, in characters and filmic rhythm, in spite of some lively or colorful scenes. The film is slow. Not that it drags, bores, or requires suspension of disbelief. Yet its approach is scattershot as it touches on comedy, romance and downplayed drama, without getting any strong mileage out of any of those.
A paradoxical curiosity. Those who know about the prudishness of the old Hollywood Code are aware of how far movie frankness has come. In an early scene, counselor Nina is discussing boys with her girls. Says one about a new male acquaintance: "What he wants is to [verb deleted] me." Nina's calm response: "The point is, do you want to [verb deleted] him?" It is odd how, within in a film where the openly sexual premises are not a bit scabrous in 1998, this dialogue jars.
On the whole, "The Object of My Affection" is the object of your attention. It holds it, but not your rapt attention. The viewer remains distanced and uninvolved. To put it simply, the movie just does not excite. But it does make for an agreeable, entertaining 110 minutes.
" Le mauvais gout mene au crime" (Stendhal)
Edwin Jahiel's movie reviews are at http://www.prairienet.org/ejahiel
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


--- layout: about title: About SSB ---
Hi! I'm Steph. I am a writer and web developer based in San Francisco. This site is a recent effort to consolidate all of the writing I've published in disparate places over the past five years. It covers everything from backpacking around South America (2012) to some journalism in Brooklyn (2011) all the way to more recent writings on design, data, algorithms, and Stoicism (2015-16).
These days I think a lot about the relationship between technology and humanity. Specifically, how does technology, something we as humans create, in turn affect us? As AI becomes a more prominent fixture in our everyday lives, what will our future begin to look like? And most importantly, in what ways can we use technology to improve ourselves and the lives of others?
When I'm not at a computer, I like to exercise, cook, and ride my bike. Sometimes I draw, paint, and play the piano. I geek out over architecture, fitness, and nutrition. I try to meditate every day. I listen to way too many podcasts.
This is what I look like.


Cancel
Delete
Duplicate theme
Title:
Cancel
Duplicate


|
Lexical Tree
|
#include "parsing.h"
Go to the source code of this file.
Functions | |
| int | check_word_in_tree (Tree t, char word[MAX_LENGTH]) |
| Checks if a word is in the tree given as parameter. More... | |
| void | test_check_word (Tree t, char word[MAX_LENGTH]) |
| print in the stdout if the word is in the tree given as parameter. More... | |
| void | parse_and_print_in_file (Tree t, FILE *f) |
| Parse the tree and print the words in the file given as argument. More... | |
Definition in file parsing.c.
| int check_word_in_tree | ( | Tree | t, |
| char | word[MAX_LENGTH] | ||
| ) |
Checks if a word is in the tree given as parameter.
| t | Tree |
| word | char[] word to check. |
| void parse_and_print_in_file | ( | Tree | t, |
| FILE * | f | ||
| ) |


|
tesseract
5.0.0-alpha-619-ge9db
|
#include <tesseract/genericvector.h>
#include "matchdefs.h"
#include "mfoutline.h"
#include "protos.h"
#include "scrollview.h"
#include "unicharset.h"
Go to the source code of this file.
Classes | |
| struct | CLASS_PRUNER_STRUCT |
| struct | INT_PROTO_STRUCT |
| struct | PROTO_SET_STRUCT |
| struct | INT_CLASS_STRUCT |
| struct | INT_TEMPLATES_STRUCT |
| struct | INT_FEATURE_STRUCT |
Namespaces | |
| tesseract | |
Typedefs | |
| typedef struct INT_PROTO_STRUCT * | INT_PROTO |
| typedef uint32_t | PROTO_PRUNER[NUM_PP_PARAMS][NUM_PP_BUCKETS][WERDS_PER_PP_VECTOR] |
| typedef struct PROTO_SET_STRUCT * | PROTO_SET |
| typedef uint32_t | CONFIG_PRUNER[NUM_PP_PARAMS][NUM_PP_BUCKETS][4] |
| typedef struct INT_CLASS_STRUCT * | INT_CLASS |
| typedef struct INT_TEMPLATES_STRUCT * | INT_TEMPLATES |
| using | INT_FEATURE = INT_FEATURE_STRUCT * |
| typedef INT_FEATURE_STRUCT | INT_FEATURE_ARRAY[MAX_NUM_INT_FEATURES] |
Enumerations | |
| enum | IntmatcherDebugAction { IDA_ADAPTIVE, IDA_STATIC, IDA_SHAPE_INDEX, IDA_BOTH } |
Functions | |
| void | AddIntClass (INT_TEMPLATES Templates, CLASS_ID ClassId, INT_CLASS Class) |
| int | AddIntConfig (INT_CLASS Class) |
| int | AddIntProto (INT_CLASS Class) |
| void | AddProtoToClassPruner (PROTO Proto, CLASS_ID ClassId, INT_TEMPLATES Templates) |
| void | AddProtoToProtoPruner (PROTO Proto, int ProtoId, INT_CLASS Class, bool debug) |
| uint8_t | Bucket8For (float param, float offset, int num_buckets) |
| uint16_t | Bucket16For (float param, float offset, int num_buckets) |
| uint8_t | CircBucketFor (float param, float offset, int num_buckets) |
| void | UpdateMatchDisplay () |
| void | ConvertConfig (BIT_VECTOR Config, int ConfigId, INT_CLASS Class) |
| void | DisplayIntFeature (const INT_FEATURE_STRUCT *Feature, float Evidence) |
| void | DisplayIntProto (INT_CLASS Class, PROTO_ID ProtoId, float Evidence) |
| INT_CLASS | NewIntClass (int MaxNumProtos, int MaxNumConfigs) |
| INT_TEMPLATES | NewIntTemplates () |
| void | free_int_templates (INT_TEMPLATES templates) |
| void | ShowMatchDisplay () |
| void | tesseract::ClearFeatureSpaceWindow (NORM_METHOD norm_method, ScrollView *window) |
| void | RenderIntFeature (ScrollView *window, const INT_FEATURE_STRUCT *Feature, ScrollView::Color color) |
| void | InitIntMatchWindowIfReqd () |
| void | InitProtoDisplayWindowIfReqd () |
| void | InitFeatureDisplayWindowIfReqd () |
| ScrollView * | CreateFeatureSpaceWindow (const char *name, int xpos, int ypos) |
| #define ANGLE_SHIFT (0.0) |
Definition at line 39 of file intproto.h.
| #define BITS_PER_CP_VECTOR (CLASSES_PER_CP * NUM_BITS_PER_CLASS) |
Definition at line 58 of file intproto.h.
| #define BITS_PER_WERD static_cast<int>(8 * sizeof(uint32_t)) |
Definition at line 44 of file intproto.h.
| #define CLASS_PRUNER_CLASS_MASK (~(~0u << NUM_BITS_PER_CLASS)) |
Definition at line 55 of file intproto.h.
| #define CLASSES_PER_CP 32 |
Definition at line 53 of file intproto.h.
| #define CLASSES_PER_CP_WERD (CLASSES_PER_CP / NUM_BITS_PER_CLASS) |
Definition at line 56 of file intproto.h.
| #define ClassForClassId | ( | T, | |
| c | |||
| ) | ((T)->Class[c]) |
Definition at line 177 of file intproto.h.
| #define ClassPrunersFor | ( | T | ) | ((T)->ClassPruner) |
Definition at line 178 of file intproto.h.
| #define CLIP_MATCH_EVIDENCE 0x020 |
Definition at line 192 of file intproto.h.
| #define ClipMatchEvidenceOn | ( | D | ) | ((D)&CLIP_MATCH_EVIDENCE) |
Definition at line 200 of file intproto.h.
| #define CPrunerBitIndexFor | ( | c | ) | (((c) % CLASSES_PER_CP) % CLASSES_PER_CP_WERD) |
Definition at line 182 of file intproto.h.
| #define CPrunerFor | ( | T, | |
| c | |||
| ) | ((T)->ClassPruners[CPrunerIdFor(c)]) |
Definition at line 180 of file intproto.h.
| #define CPrunerIdFor | ( | c | ) | ((c) / CLASSES_PER_CP) |
Definition at line 179 of file intproto.h.
| #define CPrunerMaskFor | ( | L, | |
| c | |||
| ) | (((L) + 1) << CPrunerBitIndexFor(c) * NUM_BITS_PER_CLASS) |
Definition at line 183 of file intproto.h.
| #define CPrunerWordIndexFor | ( | c | ) | (((c) % CLASSES_PER_CP) / CLASSES_PER_CP_WERD) |
Definition at line 181 of file intproto.h.
| #define DISPLAY_FEATURE_MATCHES 0x002 |
Definition at line 188 of file intproto.h.
| #define DISPLAY_PROTO_MATCHES 0x004 |
Definition at line 189 of file intproto.h.
| #define DisplayFeatureMatchesOn | ( | D | ) | ((D)&DISPLAY_FEATURE_MATCHES) |
Definition at line 196 of file intproto.h.
| #define DisplayProtoMatchesOn | ( | D | ) | ((D)&DISPLAY_PROTO_MATCHES) |
Definition at line 197 of file intproto.h.
| #define IndexForProto | ( | P | ) | (P % PROTOS_PER_PROTO_SET) |
Definition at line 166 of file intproto.h.
| #define INT_CHAR_NORM_RANGE 256 |
Definition at line 129 of file intproto.h.
| #define LegalClassId | ( | c | ) | ((c) >= 0 && (c) <= MAX_CLASS_ID) |
Definition at line 175 of file intproto.h.
| #define MatchDebuggingOn | ( | D | ) | (D) |
Definition at line 194 of file intproto.h.
| #define MAX_NUM_CLASS_PRUNERS ((MAX_NUM_CLASSES + CLASSES_PER_CP - 1) / CLASSES_PER_CP) |
Definition at line 59 of file intproto.h.
| #define MAX_NUM_CONFIGS 64 |
Definition at line 46 of file intproto.h.
| #define MAX_NUM_INT_FEATURES 512 |
Definition at line 128 of file intproto.h.
| #define MAX_NUM_PROTO_SETS (MAX_NUM_PROTOS / PROTOS_PER_PROTO_SET) |
Definition at line 49 of file intproto.h.
| #define MAX_NUM_PROTOS 512 |
Definition at line 47 of file intproto.h.
| #define MAX_PROTO_INDEX 24 |
Definition at line 43 of file intproto.h.
| #define MaxNumClassesIn | ( | T | ) | (T->NumClassPruners * CLASSES_PER_CP) |
Definition at line 174 of file intproto.h.
| #define MaxNumIntProtosIn | ( | C | ) | (C->NumProtoSets * PROTOS_PER_PROTO_SET) |
| #define NUM_BITS_PER_CLASS 2 |
Definition at line 54 of file intproto.h.
| #define NUM_CP_BUCKETS 24 |
Definition at line 52 of file intproto.h.
| #define NUM_PP_BUCKETS 64 |
Definition at line 51 of file intproto.h.
| #define NUM_PP_PARAMS 3 |
Definition at line 50 of file intproto.h.
| #define PPrunerBitIndexFor | ( | I | ) | ((I) % PROTOS_PER_PP_WERD) |
Definition at line 171 of file intproto.h.
| #define PPrunerMaskFor | ( | I | ) | (1 << PPrunerBitIndexFor(I)) |
Definition at line 172 of file intproto.h.
| #define PPrunerWordIndexFor | ( | I | ) | (((I) % PROTOS_PER_PROTO_SET) / PROTOS_PER_PP_WERD) |
Definition at line 169 of file intproto.h.
| #define PRINT_FEATURE_MATCHES 0x008 |
Definition at line 190 of file intproto.h.
| #define PRINT_MATCH_SUMMARY 0x001 |
Definition at line 187 of file intproto.h.
| #define PRINT_PROTO_MATCHES 0x010 |
Definition at line 191 of file intproto.h.
| #define PrintFeatureMatchesOn | ( | D | ) | ((D)&PRINT_FEATURE_MATCHES) |
Definition at line 198 of file intproto.h.
| #define PrintMatchSummaryOn | ( | D | ) | ((D)&PRINT_MATCH_SUMMARY) |
Definition at line 195 of file intproto.h.
| #define PrintProtoMatchesOn | ( | D | ) | ((D)&PRINT_PROTO_MATCHES) |
Definition at line 199 of file intproto.h.
| #define ProtoForProtoId | ( | C, | |
| P | |||
| ) | (&((C->ProtoSets[SetForProto(P)])->Protos[IndexForProto(P)])) |
Definition at line 167 of file intproto.h.
| #define PROTOS_PER_PP_WERD BITS_PER_WERD |
Definition at line 57 of file intproto.h.
| #define PROTOS_PER_PROTO_SET 64 |
Definition at line 48 of file intproto.h.
| #define PRUNER_ANGLE 2 |
Definition at line 36 of file intproto.h.
| #define PRUNER_X 0 |
Definition at line 34 of file intproto.h.
| #define PRUNER_Y 1 |
Definition at line 35 of file intproto.h.
| #define SetForProto | ( | P | ) | (P / PROTOS_PER_PROTO_SET) |
Definition at line 165 of file intproto.h.
| #define UnusedClassIdIn | ( | T, | |
| c | |||
| ) | ((T)->Class[c] == nullptr) |
Definition at line 176 of file intproto.h.
| #define WERDS_PER_CONFIG_VEC ((MAX_NUM_CONFIGS + BITS_PER_WERD - 1) / BITS_PER_WERD) |
Definition at line 67 of file intproto.h.
| #define WERDS_PER_CP (NUM_CP_BUCKETS * NUM_CP_BUCKETS * NUM_CP_BUCKETS * WERDS_PER_CP_VECTOR) |
Definition at line 65 of file intproto.h.
| #define WERDS_PER_CP_VECTOR (BITS_PER_CP_VECTOR / BITS_PER_WERD) |
Definition at line 61 of file intproto.h.
| #define WERDS_PER_PP (NUM_PP_PARAMS * NUM_PP_BUCKETS * WERDS_PER_PP_VECTOR) |
Definition at line 64 of file intproto.h.
| #define WERDS_PER_PP_VECTOR ((PROTOS_PER_PROTO_SET + BITS_PER_WERD - 1) / BITS_PER_WERD) |
Definition at line 62 of file intproto.h.
| #define X_SHIFT (0.5) |
Definition at line 40 of file intproto.h.
| #define Y_SHIFT (0.5) |
Definition at line 41 of file intproto.h.
| typedef uint32_t CONFIG_PRUNER[NUM_PP_PARAMS][NUM_PP_BUCKETS][4] |
Definition at line 102 of file intproto.h.
| typedef struct INT_CLASS_STRUCT * INT_CLASS |
| using INT_FEATURE = INT_FEATURE_STRUCT* |
Definition at line 149 of file intproto.h.
| typedef INT_FEATURE_STRUCT INT_FEATURE_ARRAY[MAX_NUM_INT_FEATURES] |
Definition at line 151 of file intproto.h.
| typedef struct INT_PROTO_STRUCT * INT_PROTO |
| typedef struct INT_TEMPLATES_STRUCT * INT_TEMPLATES |
| typedef uint32_t PROTO_PRUNER[NUM_PP_PARAMS][NUM_PP_BUCKETS][WERDS_PER_PP_VECTOR] |
Definition at line 92 of file intproto.h.
| typedef struct PROTO_SET_STRUCT * PROTO_SET |
| Enumerator | |
|---|---|
| IDA_ADAPTIVE | |
| IDA_STATIC | |
| IDA_SHAPE_INDEX | |
| IDA_BOTH |
Definition at line 153 of file intproto.h.
| void AddIntClass | ( | INT_TEMPLATES | Templates, |
| CLASS_ID | ClassId, | ||
| INT_CLASS | Class | ||
| ) |
This routine adds a new class structure to a set of templates. Classes have to be added to Templates in the order of increasing ClassIds.
| Templates | templates to add new class to |
| ClassId | class id to associate new class with |
| Class | class data structure to add to templates |
Globals: none
Definition at line 230 of file intproto.cpp.
| int AddIntConfig | ( | INT_CLASS | Class | ) |
This routine returns the index of the next free config in Class.
| Class | class to add new configuration to |
Globals: none
Definition at line 260 of file intproto.cpp.
| int AddIntProto | ( | INT_CLASS | Class | ) |
This routine allocates the next free proto in Class and returns its index.
| Class | class to add new proto to |
Globals: none
Definition at line 281 of file intproto.cpp.
| void AddProtoToClassPruner | ( | PROTO | Proto, |
| CLASS_ID | ClassId, | ||
| INT_TEMPLATES | Templates | ||
| ) |
This routine adds Proto to the class pruning tables for the specified class in Templates.
Globals:
| Proto | floating-pt proto to add to class pruner |
| ClassId | class id corresponding to Proto |
| Templates | set of templates containing class pruner |
Definition at line 327 of file intproto.cpp.
This routine updates the proto pruner lookup tables for Class to include a new proto identified by ProtoId and described by Proto.
| Proto | floating-pt proto to be added to proto pruner |
| ProtoId | id of proto |
| Class | integer class that contains desired proto pruner |
| debug | debug flag |
Definition at line 366 of file intproto.cpp.
| uint16_t Bucket16For | ( | float | param, |
| float | offset, | ||
| int | num_buckets | ||
| ) |
Definition at line 421 of file intproto.cpp.
| uint8_t Bucket8For | ( | float | param, |
| float | offset, | ||
| int | num_buckets | ||
| ) |
Returns a quantized bucket for the given param shifted by offset, notionally (param + offset) * num_buckets, but clipped and casted to the appropriate type.
Definition at line 417 of file intproto.cpp.
| uint8_t CircBucketFor | ( | float | param, |
| float | offset, | ||
| int | num_buckets | ||
| ) |
Returns a quantized bucket for the given circular param shifted by offset, notionally (param + offset) * num_buckets, but modded and casted to the appropriate type.
Definition at line 431 of file intproto.cpp.
| void ConvertConfig | ( | BIT_VECTOR | Config, |
| int | ConfigId, | ||
| INT_CLASS | Class | ||
| ) |
This operation updates the config vectors of all protos in Class to indicate that the protos with 1's in Config belong to a new configuration identified by ConfigId. It is assumed that the length of the Config bit vector is equal to the number of protos in Class.
| Config | config to be added to class |
| ConfigId | id to be used for new config |
| Class | class to add new config to |
Definition at line 462 of file intproto.cpp.
| ScrollView* CreateFeatureSpaceWindow | ( | const char * | name, |
| int | xpos, | ||
| int | ypos | ||
| ) |
Creates a window of the appropriate size for displaying elements in feature space.
Definition at line 1764 of file intproto.cpp.
| void DisplayIntFeature | ( | const INT_FEATURE_STRUCT * | Feature, |
| float | Evidence | ||
| ) |
This routine renders the specified feature into a global display list.
Globals:
| Feature | pico-feature to be displayed |
| Evidence | best evidence for this feature (0-1) |
Definition at line 589 of file intproto.cpp.
This routine renders the specified proto into a global display list.
Globals:
| Class | class to take proto from |
| ProtoId | id of proto in Class to be displayed |
| Evidence | total evidence for proto (0-1) |
Definition at line 607 of file intproto.cpp.
| void free_int_templates | ( | INT_TEMPLATES | templates | ) |
Definition at line 697 of file intproto.cpp.
| void InitFeatureDisplayWindowIfReqd | ( | ) |
Initializes the feature display window if it is not already initialized.
Definition at line 1755 of file intproto.cpp.
| void InitIntMatchWindowIfReqd | ( | ) |
Initializes the int matcher window if it is not already initialized.
Definition at line 1723 of file intproto.cpp.
| void InitProtoDisplayWindowIfReqd | ( | ) |
Initializes the proto display window if it is not already initialized.
Definition at line 1744 of file intproto.cpp.
| INT_CLASS NewIntClass | ( | int | MaxNumProtos, |
| int | MaxNumConfigs | ||
| ) |
This routine creates a new integer class data structure and returns it. Sufficient space is allocated to handle the specified number of protos and configs.
| MaxNumProtos | number of protos to allocate space for |
| MaxNumConfigs | number of configs to allocate space for |
Definition at line 625 of file intproto.cpp.
| INT_TEMPLATES NewIntTemplates | ( | ) |
This routine allocates a new set of integer templates initialized to hold 0 classes.
Definition at line 681 of file intproto.cpp.
| void RenderIntFeature | ( | ScrollView * | window, |
| const INT_FEATURE_STRUCT * | Feature, | ||
| ScrollView::Color | color | ||
| ) |
This routine renders the specified feature into ShapeList.
| window | to add feature rendering to |
| Feature | feature to be rendered |
| color | color to use for feature rendering |
Definition at line 1603 of file intproto.cpp.
| void ShowMatchDisplay | ( | ) |
| void UpdateMatchDisplay | ( | ) |
This routine clears the global feature and proto display lists.
Globals:
Definition at line 446 of file intproto.cpp.


APOLLO 13 A film review by Christopher Null Copyright 1995 Christopher Null
Ron Howard has arrived.
I scarcely know where to start writing about APOLLO 13, the long-awaited story of the catastrophic 13th mission of the Apollo space program. I went in expecting a whole lot from Howard and his star-studded cast (Tom Hanks, Gary Sinise, Ed Harris, Kevin Bacon, and Bill Paxton), and they delivered in full, the star being Hanks as usual, who brings his usual strength and subtle forcefulness to the role of Jim Lovell, the 4-time space shot veteran who never managed to set foot on the moon.
The story of APOLLO 13 is simple and well-known to many Americans: on April 11, 1970, at 13:13 military time, the Apollo-Saturn 13 spacecraft was launched, carrying a crew of three men, bound for America's third landing on the moon. A third moon landing was by then rather blase to the American public--so dull and common as to not even warrant broadcast on television. On the way to their destination, however, on April 13, an oxygen tank exploded, making a moon landing impossible and the return flight home one of the most grueling experiences imaginable.
The meat of APOLLO 13 concerns this return trip: cutting off all the systems to save power and almost freezing to death in an unheated space module, struggling to improvise a carbon dioxide filter to keep from asphyxiating, almost guessing at course corrections thanks to an unusable computer, the newfound media interest that comes along with any tragedy, and the pain that comes with come getting so close to something you just can't have.
Hanks is a latter-day master of expressing this emotion. As they fly by, unable to land, we see Hanks gaze longingly out over the lunar surface he so desperately wants to walk upon. The pain is clearly visible: so near yet so far. The rest of the cast is also superbly matched to their roles (with the notable exception of Kathleen Quinlan as Lovell's wife, who sleepwalks through the film). Harris is terrific as seething flight director Gene Krantz, determined to keep the men alive when everyone else has given up, and Paxton turns in a surprisingly emotional role as Fred Haise, who becomes ill on the mission but pulls through anyway.
Overall, APOLLO 13 is one of the best films of the year, right after SHALLOW GRAVE. Howard's seamless use of special effects (none of the film is stock footage) blends perfectly with the 1970 kitsch of tie-dyes, metallic gold cars, and Dick Cavett. What he finally delivers is something he's been shooting for during his entire career as a director: a painstakingly detailed, in-depth look at the mission and the people in it, never trivializing their struggle, while generally avoiding sensationalism as well. All the while, Howard manages to entertain.
APOLLO 13 gets my blanket recommendation. You know, I was never overly superstitious about the number 13 in the past. If nothing else, this movie has certainly changed that.
RATING: ****1/2
+---------------------------------------+ |* Unquestionably awful | |** Sub-par on many levels | |*** Average quality, hits and misses | |**** Good, memorable film | |***** Perfection |
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


| I l@ve RuBoard |
We're big on reading. As we noted in Your Knowledge Portfolio, a good programmer is always learning. Keeping current with books and periodicals can help. Here are some that we like.
If you're like us, you'll save old magazines and periodicals until they're piled high enough to turn the bottom ones to flat sheets of diamond. This means it's worth being fairly selective. Here are a few periodicals we read.
IEEE Computer. Sent to members of the IEEE Computer Society, Computer has a practical focus but is not afraid of theory. Some issues are oriented around a theme, while others are simply collections of interesting articles. This magazine has a good signal-to-noise ratio.
IEEE Software. This is another great bimonthly publication of the IEEE Computer Society aimed at software practitioners.
Communications of the ACM. The basic magazine received by all members of the ACM, CACM has been a standard in the industry for decades, and has probably published more seminal articles than any other source.
SIGPLAN. Produced by the ACM Special Interest Group on Programming Languages, SIGPLAN is an optional addition to your ACM membership. It is often used for publishing language specifications, along with articles of interest to everyone who likes looking deeply into programming.
Dr. Dobbs Journal. A monthly magazine, available by subscription and on newsstands, Dr. Dobbs is quirky, but has articles ranging from bit-level practice to heavy theory.
The Perl Journal. If you like Perl, you should probably subscribe to The Perl Journal (www.tpj.com).
Software Development Magazine. A monthly magazine focusing on general issues of project management and software development.
There are several weekly newspapers published for developers and their managers. These papers are largely a collection of company press releases, redressed as articles. However, the content is still valuable—it lets you track what is going on, keep abreast of new product announcements, and follow industry alliances as they are forged and broken. Don't expect a lot of in-depth technical coverage, though.
Computing books can be expensive, but choose carefully and they're a worthwhile investment. Here are a handful of the many we like.
Object-Oriented Software Construction, 2nd Edition. Bertrand Meyer's epic book on the fundamentals of object-oriented development, all in about 1,300 pages [Mey97b].
Design Patterns. A design pattern describes a way to solve a particular class of problems at a higher level than a programming language idiom. This now-classic book [GHJV95] by the Gang of Four describes 23 basic design patterns, including Proxy, Visitor, and Singleton.
Analysis Patterns. A treasure trove of high-level, architectural patterns taken from a wide variety of real-world projects and distilled in book form. A relatively quick way to gain the insight of many years of modeling experience [Fow96].
The Mythical Man Month. Fred Brooks' classic on the perils of organizing project teams, recently updated [Bro95].
Dynamics of Software Development. A series of short essays on building software in large teams, focusing on the dynamics between team members, and between the team and the rest of the world [McC95].
Surviving Object-Oriented Projects: A Manager's Guide. Alistair Cockburn's "reports from the trenches" illustrate many of the perils and pitfalls of managing an OO project— especially your first one. Mr. Cockburn provides tips and techniques to get you through the most common problems [Coc97b].
Unix. W. Richard Stevens has several excellent books including Advanced Programming in the Unix Environment and the Unix Network Programming books [Ste92, Ste98, Ste99].
Windows. Marshall Brain's Win32 System Services [Bra95] is a concise reference to the low-level APIs. Charles Petzold's Programming Windows [Pet98] is the bible of Windows GUI development.
C++. As soon as you find yourself on a C++ project, run, don't walk, to the bookstore and get Scott Meyer's Effective C++, and possibly More Effective C++ [Mey97a, Mey96]. For building systems of any appreciable size, you need John Lakos' Large-Scale C++ Software Design [Lak96]. For advanced techniques, turn to Jim Coplien's Advanced C++ Programming Styles and Idioms [Cop92],
In addition, the O'Reilly Nutshell series (www.ora.com) gives quick, comprehensive treatments of miscellaneous topics and languages such as perl, yacc, sendmail, Windows internals, and regular expressions.
Finding good content on the Web is hard. Here are several links that we check at least once a week.
Slashdot. Billed as "News for nerds. Stuff that matters," Slashdot is one of the net homes of the Linux community. As well as regular updates on Linux news, the site offers information on technologies that are cool and issues that affect developers.
Cetus Links. Thousands of links on object-oriented topics.
WikiWikiWeb. The Portland Pattern Repository and patterns discussion. Not just a great resource, the WikiWikiWeb site is an interesting experiment in collective editing of ideas.
| I l@ve RuBoard |


Thank you for submitting an order to The Shallows. Your order will be printed and distributed to another viewer. Check the Ledger to browse Change Orders entered by others.
Who are you? Offer a name, an identifier, or some initials.
Anything else to add about the changes you're making?


{% extends 'report.html' %} {% load filename %} {% block report_type %}Get A-site Offsets: {% endblock %} {% block report %}
| Fragment size | Frame 0 | Frame 1 | Frame 2 |
|---|
By default, all fragment sizes are shown in the following figures. You can exclude a fragment size by clicking on the legend for that fragment size.
| Fragment size | Frame 0 | Frame 1 | Frame 2 |
|---|


We are TriDIYBio
The triangle DIYbio group’s mission is to further the idea that anyone can participate in the exciting scientific fields of biology, genetic engineering, and biotechnology. We strive to provide the tools, knowledge, and support to the local area in order to build a vibrant community of enabled citizen scientists and empowered Do-It-Yourself biologists!
What are we trying to do?
We want to supply the Research Triangle area of North Carolina with access to a community-based wet lab. In this lab our members will be able to provide workshops on current cutting-edge biology techniques, meet and discuss the latest in open-source research, and explore interesting questions by doing hands-on group research projects.
What can you do with DIYbio?
Do-It-Yourself biology has come to mean a lot of different things. Some great examples of projects created by community bio labs include:
- Participating in innovative group research projects such as The Vegan Cheese project and Open Source Insulin
- Designing, building, and repairing your own tailor-made scientific equipment for ultra-low cost (e.g. OpenPCR project)
- Exploring the mysteries of your genome by doing your own personal genetic testing
- Learning about the microbiological world around you by surveying your own backyard, local park, or public restroom for species of bacteria and microbes
by -


This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
- Sleep Powder
- Psychic
- Explosion
- Mega Drain / Stun Spore / Double-Edge / Hyper Beam
This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
Toxic, Egg Bomb
This analysis is a placeholder with a sample set. If you want to contribute new analyses for the site, contact Disaster Area on Discord.
Author: Disaster Area
Publish Date: 5th July 2020


The best cars in the world
newest
catalogue
contact
Cars
General representation of a car in Ukraine
See all
BMW
Mercedes-Benz
Ford-Mustang
Audi


#include <resource.h>
Inheritance diagram for TResourceCollection::
Public Methods | |
| TResourceCollection (StreamableInit) | |
| TResourceCollection (short aLimit, short aDelta) | |
| virtual void* | keyOf (void *item) |
Static Public Methods | |
| TStreamable* | build () |
Static Public Attributes | |
| const char* const | name |
Definition at line 147 of file resource.h.
|
|
Each streamable class needs a "builder" to allocate the correct memory for its objects together with the initialized vtable pointers. This is achieved by calling this constructor with an argument of type StreamableInit. Definition at line 156 of file resource.h. |
|
|
Creates a resource collection with initial size `aLimit' and the ability to resize by `aDelta'. |
|
|
Called to create an object in certain stream-reading situations. Reimplemented from TStringCollection. |
|
|
Returns the key of the given item. Reimplemented from TNSSortedCollection. |
|
|
Class name used by the stream manager. Reimplemented from TStringCollection. Definition at line 196 of file resource.h. |


Crab salad
- ⏲ Prep time: 10 min
- 🍳 Cook time: 30 min
- 🍽 Servings: 3
Ingredients
- Сrab meat (300 grams)
- Egg (3)
- Rice (50 grams)
- Corn (1 can)
- Cucumber (1)
- Carrot (1)
- Onion (1)
- Mayonnaise (100 grams)
Directions
- Boil rice, eggs and carrot
- Chop crab meat and all other ingredients
- Combine and mix all ingredients
- Add mayonnaise
- Chill before serving
Contribution
Anonymous
Recipe tags:
salad
russian


WITNESS LIST Economic Development Committee April 20, 1999-9:00A HB 2450 FOR: McKinney, Mike (Wholesale Beer Distributors of Texas), Austin Registering, but not testifying: For: Gray, Alan (Licensed Beverage Distributors), Austin Sparks, Robert (Licensed Beverage Distributors), Austin SB 169 Registering, but not testifying: On: Doss, Dianna (Texas State Florists' Assn.), Austin SB 288 FOR: Davis, Will (Texas Assoc. of Life & Health Insurers), Austin Registering, but not testifying: For: Barron, Connie (Texas Medical Association), Austin Evans, Richard (TABCC), Austin Hanners, Sally (Texas Dental Association), Austin Keene, Russ (AETNA), Austin Kloster, Jeff (Tx. Assoc. of Health Plans), Austin Leiferman, Cynthia (Advocacy, Inc.), Austin Pollard, Mike (Texas Assoc. of Life & Health Insurers), Austin Samuels, Marc (Texas Pediatric Society), Austin Against: Payne, Tyson (Texas Association of Life Underwriters), Austin Simonton, Kay (Blue Cross & Blue Shield of Texas), Austin On: Myron, Rhonda (Texas Department of Insurance), Austin SB 497 FOR: Leiferman, Cynthia (Advocacy, Inc.), Austin McGiffert, Lisa (Consumers Union), Austin McPherson, Kim (The Mental Health Association of Texas), Austin AGAINST: Davis, Will (Texas Assoc. of Life & Health Insurers), Austin ON: Myron, Rhonda (Texas Department of Insurance), Austin Registering, but not testifying: Against: Pollard, Mike (Texas Assoc. of Life & Health Insurers), Austin Thompson, Jay (Texas Assoc. of Life & Health Insurers), Austin SB 508 Registering, but not testifying: For: Powers, Bill (Texas Farm Bureau), Austin SB 512 Registering, but not testifying: For: Kloster, Jeff (Texas Assoc. of Health Plans), Austin SB 532 Registering, but not testifying: For: Judge Prindle, Sandy (Justices of the Peace Assn.), Hurst SB 538 FOR: Rothstein, Mark (Self), Houston Sokolow, Judith (Advocacy, Inc.), Austin AGAINST: Pollard, Mike (Texas Assoc. of Life & Health Insurers), Austin Thompson, Jay (Texas Assoc. of Life & Health Insurers), Austin Registering, but not testifying: For: Gilchrist, Alfred (Texas Medical Association), Austin Marshall, Susan (The Arc of Texas), Austin McGiffert, Lisa (Consumers Union), Austin Samuels, Marc (Texas Pediatric Society), Austin Westbrook, Redge (CTD- Coalition of Texans with Disabilities), Austin Against: Davis, Will (Texas Assn. of Life & Health Insurers), Austin On: Myron, Rhonda (Texas Department of Insurance), Austin SB 623 Registering, but not testifying: For: Marshall, Susan (The Arc of Texas & Texas Advocates), Austin Schwartz, Jonas (United Cerebral Palsy of Texas), Austin Sokolow, Judith (Advocacy, Inc.), Austin On: Erben, Andrew (Texas Association of Builders), Austin Garvin, John (Texas Department of Housing and Community Affairs), Austin SB 1029 Registering, but not testifying: For: Matula, Ivan (Texas Acupuncture Association), Austin Myers, Leslie (Texas Acupuncture Association), Driftwood Newbold, Dee Ann (Texas Acupuncture Association), Austin Payne, Tyson (Texas Association of Life Underwriters), Austin Against: Pollard, Mike (Texas Assoc. of Life & Health Insurers), Austin Simonton, Kay (Blue Cross & Blue Shield of Texas), Austin On: Myron, Rhonda (Texas Department of Insurance), Austin SB 1030 Registering, but not testifying: For: Banning, Tom (Texas Academy of Family Physicians), Austin Barron, Connie (Texas Medical Association), Austin Gonzales, David (Legend Pharmacists), Austin Gray, Tammy (Lamar Plaza Drug Store), Austin Leiferman, Cynthia (Advocacy, Inc.), Austin Marshall, Susan (The Arc of Texas), Austin McGiffert, Lisa (Consumers Union), Austin McPherson, Kim (The Mental Health Association in Texas), Austin Payne, Tyson (Texas Association of Life Underwriters), Austin Against: Kloster, Jeff (Texas Association of Health Plans), Austin On: Bordelon, Rod (Office of the Public Insurance Counsel), Austin Myron, Rhonda (Texas Department of Insurance), Austin SB 1063 Registering, but not testifying: For: Banning, Tom (Texas Academy of Family Physicians), Austin Horne, Allen (Texas Hospital Association), Austin Kolodzey, Patricia (Texas Hospital Association), Austin Walker, Craig Alan (Tx. Org. of Rural & Community Hosp.,Tx. Rural Health Assn.), Austin Wallace, B.R. (Skipper) (RCHS Board), Lampasas On: Myron, Rhonda (Texas Department of Insurance), Austin Tessen, Robert "Sam" (Center for Rural Health Initiatives), Austin SB 1246 Registering, but not testifying: For: Donaldson, Nub (Car & Truck Rental & Leasing Association), Austin On: Durden, David (Texas Department of Insurance), Austin SB 1274 AGAINST: Baldwin, George (Associated General Contractors), Austin ON: Mitchell, Mark (Self), Austin Registering, but not testifying: For: Bruns, Richard (Texas Construction Association), Austin SB 1376 FOR: Davis, Will (Texas Assoc. of Life & Health Insurers), Austin Patterson, Jerry (Texas Association of Health Plans), Austin ON: Myron, Rhonda (Texas Department of Insurance), Austin Registering, but not testifying: For: Keene, Russ (Self), Dallas Pollard, mike (Texas Assoc. of Life & Health Insurers), Austin Yates, Jim (Self), San Antonio Against: Simonton, Kay (Blue Cross & Blue Shield of Texas), Austin SB 1787 ON: Smith, Ricky (Texas Department of Public Safety), Austin Registering, but not testifying: For: Gilbert, Bo (Independent Insurance Agents of Texas), Austin Huxel, Bob (Farmers Insurance Group), Austin Simpson, Robert (State Farm Insurance Companies), Austin Against: Schneider, Rob (Consumers Union), Austin On: Durden, David (Texas Department of Insurance), Austin Hunt, Darrel (Texas Department of Transportation), Lago Vista Smith, Dewayne Lee (Texas Department of Public Safety), Austin


Enable / Disable third panel
Expand open panels
Some content
The body of the accordion group grows to fit the contents
Venga, dale para añadir


Retrospectively Blue Lotus has been a very beneficial plant ally. Nine months ago I purchased 80g of lotus from an internet vendor having heard of its effects and researching it onLINE. My psychoactive experiences have been reasonably limited, being careful of substances I try, only natural ones that I’ve researched. My experience history is cannabis, mushrooms, salvia divinorum and other less powerful plants in the legal arena.
I received the blue lotus after a long wait and was anxious to try it once it arrived. It came in two large packs of dried flower material. I’ve tested it smoked in joints, through a hookah, in tincture form and as a tea.
The effects seemed to be similar to how I imagined from descriptions I had earlier read, an alert sedation. I noticed extreme muscle relaxation, a lift in mood and a stoned outlook. The effects are noticeable almost immediately, after one hit held for fifteen to twenty seconds and the familiar sense of well-being and sedation are accomplished. Often I would roll two joints of lotus for each of my friends after grinding it. The supply of lotus never seemed to waver either, the large amount I had lasted, as long as lotus is only smoked, a small quantity lasts a long while.
When blue lotus is smoked a gentle stoned feeling begins and even in the middle of college term, it takes me to a holiday zone. An uplifted feeling, distant troubles and a relaxed body, it gives me that holiday feeling, as best as I can describe. The only drawback of smoked lotus is that it seems to make me incredibly tired, incredibly quickly, which can be an annoyance. The lotus is noticeable and active at low doses, anywhere from 2 to 6 grams is enough to feel its effects.
The two exceedingly large bags of unground lotus arrived, I first noted the smell of the lotus, it was very weak smelling- I could barely smell it whatsoever, the vague fragrance is sweet though. The lotus also burnt well, in the hookah the lotus stays hot and the smoke is easy to continually smoke, the smoke tastes fine and after a while it even has an almost caramel quality.
I’ve talked to some friends about the effects of lotus and given one of them, T, some, after ‘sessions’ at my house. I would definitely say that lotus has an almost “anti-addictive” quality, it never jumps into my mind, I never get cravings or feel particularly like smoking some. Until of course I take a few hits of it, feel the effects- the positive effects and decide to smoke some more.
The effects of lotus also seems very synergistic with other plants and herbs. Cannabis and blue lotus seem synergistic in so much as the effects of cannabis are calmed to some degree. The difference between a cannabis experience and a cannabis and lotus experience is that there is a slower mental high. Often with cannabis it seems that my ideas flow too fluidly- once I almost finish one thought I am consumed by the next and have already forgotten the last. The addition of lotus slows down this process making the high much more tranquil. Lotus also makes me notice their environment more, so the cannabis has an expansive feeling attached to it, often it feels like my peripheral vision has been opened up, though this might be due to the dilation of pupils from the weed and the increase of awareness blue lotus results in.
The effects of this lotus also is interesting when combined with tobacco. I imagine the mind is like a line, to the left is sedation, to the right is stimulation. Lotus certainly is an effective sedative and tobacco is seen as a slight stimulant. When these are combined, there is a stretching of the position of my mind on the line and the result for me is the muscle relaxation achieved by lotus yet the mental ‘buzz’ of tobacco. This is a very good mixture for chilling out with, it is very stress relieving for me. This is interesting and sometimes preferable to lotus on its own due to its relaxing but nonexhaustative qualities, in my opinion.
Another two situations where the effects of blue lotus prove synergistic are when it is combined with calea zacatechichi or alcohol. Lotus and calea mix well because calea tastes very sour on the exhale, when mixed with lotus the taste is nullified. Also calea is mainly smoked for its dream enhancing effects and lotus undeniably induces sleep- which is welcome when linear and detailed dreams may follow. Blue lotus and alcohol synergise well for separate reasons, its effects on alcohol are similar to its effects on cannabis, it “cleans up” the high and calms it somewhat. The effects of alcohol are present after drinking it in a tincture and are calmer but more disorientating.
I have only made a tea with lotus once, I used about twenty-five grams but shared it with a friend. The effects of this lasted longer, it was weird actually, the tea (unfiltered since I made it at his house) was really difficult to force down but after half an hour I was feeling the familiar effects of lotus but with a new sense of warmth, we finished the tea around one and continued smoking joints of lotus well into the night (we were out of everything but lotus.) The effects were very strong though, we shared eight joints and after a few hours were really quite stoned. The strange part was that when we woke up to go into London, we were still both light, jovial and stoned.
A really relaxed and pleasant mood continued for hours. On the journey however I experienced effects I never had from blue lotus, a comedown, and a hard comedown at that, me and my friend T just sat on the train in silence, both staring blankly around the train, my thoughts were spiraling very negatively which is very rare considering my optimistic nature- especially around friends. I am sure that this was because of the tea, maybe through use of any method, smoked or drank, this dose would cause depression the day after.
Ultimately though, lotus is certainly a useful herb to have at my disposal, it is the master of synergy, I imagine it goes with everything really, except psychedelics, I have tried it with salvia and no difference was noticeable to be honest, I suppose its because psychedelics aren’t really on the ‘mind line’ that I mentioned, only partially sedating or stimulating, I cannot be sure though, some psychedelics might synergise with blue lotus, I’ve only attempted with salvia.
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.


Welcomes to Summit Tech World's login database...
Remember Me
Login
Forgot Password?
Create an Account!


--- layout: blog title: "Blog" permalink: blog.html group: "navigation" order: 4 ---
{{ post.subtitle }}
BY {{ post.tags | first }} ON {{ post.date | date: "%b %-d, %Y" }}


Contents
Step 2 Feedstock¶
Goal:¶
To use base feedstock that preserves ./or restores natural capital while providing performance and other sustainability benefits.
Introduction to Feedstock Concerns¶
According to the World Forum on Natural Capital, natural capital is defined as the world’s stocks of natural assets that include geology, soil, air, water and all living things. Humans depend on natural capital for a wide range of ecosystem services. Poorly managed natural capital can destroy productivity and resilience, making it more difficult for humans and other species to sustain themselves (6). To meet the design principle of Maximizing Resource Efficiency, it is necessary to preserve natural capital. The choice of feedstock can have significant impacts on natural capital.
Best practices strive to decouple feedstock selection from negative impacts on natural capital such as natural resource depletion and negative impacts on communities from raw material extraction. Some feedstock is not renewable but it may be abundant.
Other feedstock such as certain metals may be rare and metals are of course not renewable. The use of renewable feedstock will not be sustainable if degradation or consumption of it occurs at a rate that is faster than the resource can regenerate. If a depleting feedstock is used, then care should be taken to ensure that the materials will be recycled once no longer needed.
Products based on depleting natural resources or renewable resources that degrade land or compete with food production do not preserve natural capital and do not support sustainable product design. Feedstock derived from easily recycled materials, readily available wastes such as agricultural wastes or rapidly renewable and abundant biomass like algae or seaweed may help to preserve natural capital. For some renewable raw materi./feedstock, certification programs are available to ensure that the resources are responsibly managed for environmental, social and economic benefits.
At a minimum, define the primary feedstock used to generate the chemical, material or product. In general, rapidly renewable or waste derived feedstock results in supply chain benefits. Evaluations can be enhanced by ‘designing with the end in mind’. Think about whether or not there is a relationship between feedstock and waste management options. Can they be linked to create both supply and demand for materials that cycle in a sustainably managed material economy.
Example¶
TidalVision USA uses waste from sustainable fisheries¶
TidalVision USA is an early stage company based in Bellingham, WA that uses fishery wastes to make high value products. They refer to this as ‘upcycling’ because a low value waste material is used to make a high value product. Their goal is to add value to the sustainable fishing and crabbing industries by generating value from the waste. The company treats salmon skins to make salmon leather using benign chemical process and makes wallets, purses, and other high value products. They also process crab waste to make a variety of useful products based on chitosan that is derived from the chitin in the shell wastes. The founder of the company is an Alaskan fisherman who was disturbed by the scale of fisheries byproduct wastes and became a social and environmental entrepreneur. He uses wastes from sustainable fisheries to add value to an industry that strives to operate sustainably.


"People just want the highlights, except when they don't, in which case they want everything." Source: A wise hackernews comment
"People just want the highlights, except when they don't, in which case they want everything."


{% extends 'base.html' %} {% block page_specific_css %} {% endblock %} {% block content%}
Note that this will overwrite any existing constraints on this project!
Existing constraints:


 It sucked but... I needed the cash."
 It sucked but... I needed the cash."


A suite of tools for collecting and constructing networks from social media data. Provides easy-to-use functions for collecting data across popular platforms (Instagram, Facebook, Twitter, and YouTube) and generating different types of networks for analysis.
| Version: | 0.23.4 |
| Imports: | tm, stringr, twitteR, RCurl, bitops, rjson, plyr, igraph, Rfacebook (≥ 0.6.15), Hmisc, data.table, httpuv, instaR, methods, httr |
| Suggests: | magrittr, testthat |
| Published: | 2018-07-05 |
| Author: | Timothy Graham & Robert Ackland with contribution from Chung-hong Chan |
| Maintainer: | Timothy Graham <Timothy.Graham at anu.edu.au> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | vosonSML results |
| Reference manual: | vosonSML.pdf |
| Package source: | vosonSML_0.23.4.tar.gz |
| Windows binaries: | r-devel: vosonSML_0.23.4.zip, r-release: vosonSML_0.23.4.zip, r-oldrel: vosonSML_0.23.4.zip |
| OS X binaries: | r-release: vosonSML_0.23.4.tgz, r-oldrel: vosonSML_0.23.4.tgz |
Please use the canonical form https://CRAN.R-project.org/package=vosonSML to link to this page.


Jimmie Johnson announces NASCAR retirement after 2020 season
by WVLT News(WVLT) -- NASCAR driver Jimmie Johnson, announced Wednesday that 2020 will be his final year as a full-time competitor. The seven-time NASCAR Cup Series champion announced his decision in a post on Twitter.
Johnson joined the NASCAR cup series in 2001 and became the full-time driver for Hendrick Motorsports in 2002. The two-time Daytona 500 winner is tied with Richard Petty and Dale Earnhardt for the most titles in history.
This year, Johnson was ranked 18th and missed the Monster Energy NASCAR Cup Series Championship Playoffs for the first time.


Bindings to 'FFmpeg' <http://www.ffmpeg.org/> AV library for working with audio and video in R. Generate high quality videos files by capturing images from the R graphics device combined with custom audio stream. This package interfaces directly to the C API and does not require any command line utilities.
| Version: | 0.2 |
| Suggests: | testthat, ps, ggplot2, gapminder |
| Published: | 2018-09-30 |
| Author: | Jeroen Ooms [aut, cre] |
| Maintainer: | Jeroen Ooms <jeroen at berkeley.edu> |
| BugReports: | https://github.com/ropensci/av/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/ropensci/av (devel) http://www.ffmpeg.org/ (upstream) |
| NeedsCompilation: | yes |
| SystemRequirements: | FFmpeg >= 3.2: libavfilter-dev (deb), ffmpeg-devel(rpm) |
| CRAN checks: | av results |
| Reference manual: | av.pdf |
| Package source: | av_0.2.tar.gz |
| Windows binaries: | r-devel: av_0.2.zip, r-release: av_0.2.zip, r-oldrel: av_0.2.zip |
| OS X binaries: | r-release: av_0.2.tgz, r-oldrel: av_0.2.tgz |
| Reverse suggests: | magick |
Please use the canonical form https://CRAN.R-project.org/package=av to link to this page.


Running Spark on Mesos
Spark can run on private clusters managed by the Apache Mesos resource manager. Follow the steps below to install Mesos and Spark:
- Download and build Spark using the instructions here.
- Download Mesos 0.9.0-incubating from a mirror.
- Configure Mesos using the
configure
script, passing the location of yourJAVA_HOME
using--with-java-home
. Mesos comes with “template” configure scripts for different platforms, such asconfigure.macosx
, that you can run. See the README file in Mesos for other options. Note: If you want to run Mesos without installing it into the default paths on your system (e.g. if you don’t have administrative privileges to install it), you should also pass the--prefix
option toconfigure
to tell it where to install. For example, pass--prefix=/home/user/mesos
. By default the prefix is/usr/local
. - Build Mesos using
make
, and then install it usingmake install
. - Create a file called
spark-env.sh
in Spark’sconf
directory, by copyingconf/spark-env.sh.template
, and add the following lines in it:export MESOS_NATIVE_LIBRARY=<path to libmesos.so>
. This path is usually<prefix>/lib/libmesos.so
(where the prefix is/usr/local
by default). Also, on Mac OS X, the library is calledlibmesos.dylib
instead of.so
.export SCALA_HOME=<path to Scala directory>
.
- Copy Spark and Mesos to the same paths on all the nodes in the cluster (or, for Mesos,
make install
on every node). - Configure Mesos for deployment:
- On your master node, edit
<prefix>/var/mesos/deploy/masters
to list your master and<prefix>/var/mesos/deploy/slaves
to list the slaves, where<prefix>
is the prefix where you installed Mesos (/usr/local
by default). - On all nodes, edit
<prefix>/var/mesos/conf/mesos.conf
and add the linemaster=HOST:5050
, where HOST is your master node. - Run
<prefix>/sbin/mesos-start-cluster.sh
on your master to start Mesos. If all goes well, you should see Mesos’s web UI on port 8080 of the master machine. - See Mesos’s README file for more information on deploying it.
- On your master node, edit
- To run a Spark job against the cluster, when you create your
SparkContext
, pass the stringmesos://HOST:5050
as the first parameter, whereHOST
is the machine running your Mesos master. In addition, pass the location of Spark on your nodes as the third parameter, and a list of JAR files containing your JAR’s code as the fourth (these will automatically get copied to the workers). For example:
new SparkContext("mesos://HOST:5050", "My Job Name", "/home/user/spark", List("my-job.jar"))
If you want to run Spark on Amazon EC2, you can use the Spark EC2 launch scripts, which provide an easy way to launch a cluster with Mesos, Spark, and HDFS pre-configured. This will get you a cluster in about five minutes without any configuration on your part.
Mesos Run Modes
Spark can run over Mesos in two modes: “fine-grained” and “coarse-grained”. In fine-grained mode, which is the default, each Spark task runs as a separate Mesos task. This allows multiple instances of Spark (and other applications) to share machines at a very fine granularity, where each job gets more or fewer machines as it ramps up, but it comes with an additional overhead in launching each task, which may be inappropriate for low-latency applications that aim for sub-second Spark operations (e.g. interactive queries or serving web requests). The coarse-grained mode will instead launch only one long-running Spark task on each Mesos machine, and dynamically schedule its own “mini-tasks” within it. The benefit is much lower startup overhead, but at the cost of reserving the Mesos resources for the complete duration of the job.
To run in coarse-grained mode, set the spark.mesos.coarse
system property to true before creating your SparkContext:
System.setProperty("spark.mesos.coarse", "true")
val sc = new SparkContext("mesos://HOST:5050", "Job Name", ...)
In addition, for coarse-grained mode, you can control the maximum number of resources Spark will acquire. By default,
it will acquire all cores in the cluster (that get offered by Mesos), which only makes sense if you run just a single
job at a time. You can cap the maximum number of cores using System.setProperty("spark.cores.max", "10")
(for example).
Again, this must be done before initializing a SparkContext.
Running Alongside Hadoop
You can run Spark and Mesos alongside your existing Hadoop cluster by just launching them as a separate service on the machines. To access Hadoop data from Spark, just use a hdfs:// URL (typically hdfs://<namenode>:9000/path
, but you can find the right URL on your Hadoop Namenode’s web UI).
In addition, it is possible to also run Hadoop MapReduce on Mesos, to get better resource isolation and sharing between the two. In this case, Mesos will act as a unified scheduler that assigns cores to either Hadoop or Spark, as opposed to having them share resources via the Linux scheduler on each node. Please refer to the Mesos wiki page on Running Hadoop on Mesos.
In either case, HDFS runs separately from Hadoop MapReduce, without going through Mesos.


My Portfolio View my web development projects below. HTML and CSS Responsive Web Projects Survey Form Tribute Page Technical Doc Page Landing Page React Projects Pomodoro Clock JavaScript Calculator Random Quote Machine D3 Projects Choropleth Map Heat Map


Loading...
Please select filters and click "Generate" to build a blacklist.
Name Contains
Has Tag
Map Contains
Public ConVars
Quick-Add
Pinion Adverts
MOTDgd Adverts
Saigns
NighTeam
Trade Servers
Idle Servers
Instant Respawn
Tournament Mode
No Gravetalk
Password-Protected
Generate


| 2-D graphics techniques haven't really changed all that much since the days of the Apple II and Commodore 64. |
Waaaaat?
I have to step in here.... 2D graphics have changed tremendously.
2D graphics techniques back in the day focus on blitting, dirty rects, and color keying. If you are reading anything that uses any of those terms, you should throw it in the garbage. None of that applies today. Everything now is polygon rendering and programmable shaders. It's an entirely different world.
Modern 2D graphics aren't even really 2D graphics. They are 3D graphics set to an orthagonal view to give the appearance of 2D.
2D graphic libs abstract drawing to be simpler so you don't have to deal with the complexities that the 3D environment adds, but a lot of the concepts come from 3D.
Books on DOS in particular are horrid because DOS had a lot of restrictions on graphics and setting up graphic modes and stuff that simply do not apply on modern computers. In fact many techniques used to speed up DOS graphics will actually
significantly slow down your program if you attempt them on modern hardware.
An old book might give you insight on non-graphical areas of game organization... but even those I would question as better techniques probably have come along since then. But you
definitely should not take any cues on graphics from anything that old.
Really... a 20 year old computer book is a dinosaur and is practically worthless -- look how much computers have changed in that time. Let alone the C++ language.


| public concept | AdditiveGroup<T> | |
| public concept | AdditiveMonoid<T> | |
| public concept | AdditiveSemigroup<T> | |
| public concept | BackInsertionSequence<T> | A Container having an Add operation that appends an element to the end of the container. |
| public concept | BidirectionalContainer<T> | A Container whose iterators are BidirectionalIterator s. |
| public concept | BidirectionalIterator<T> | An iterator that can move forwards and backwards. |
| public concept | BinaryFunction<T> | A function object whose function call operator has two parameters. |
| public concept | BinaryOperation<T> | A BinaryFunction object where the return type and the first parameter type of the function call operator are the same type. |
| public concept | BinaryPredicate<T> | A Boolean-valued BinaryFunction object. |
| public concept | CommutativeSemiring<T> | |
| public concept | Container<T> | A collection of elements that provides iterators, element count and empty predicate. |
| public concept | ConversionFromByte<T> | |
| public concept | ConversionFromSByte<T> | |
| public concept | CopyAssignable<T> | |
| public concept | CopyAssignable<T, U> | |
| public concept | CopyConstructible<T> | |
| public concept | Copyable<T> | |
| public concept | DefaultConstructible<T> | |
| public concept | Destructible<T> | |
| public concept | EqualityComparable<T> | A type whose objects can be compared with operators == and !=. |
| public concept | EqualityComparable<T, U> | |
| public concept | EuclideanSemiring<T> | |
| public concept | ForwardContainer<T> | A Container whose iterators are ForwardIterator s. |
| public concept | ForwardIterator<T> | An iterator that can move forwards. |
| public concept | FrontInsertionSequence<T> | A Container having an InsertFront operation that inserts an element to the beginning of the container. |
| public concept | HashFunction<T, Key> | |
| public concept | InputIterator<T> | |
| public concept | InsertionSequence<T> | |
| public concept | Integer<I> | |
| public concept | KeySelectionFunction<T, Key, Value> | |
| public concept | LessThanComparable<T> | A type whose objects can be compared with operators <, >, <= and >=. |
| public concept | LessThanComparable<T, U> | |
| public concept | Movable<T> | |
| public concept | MoveAssignable<T> | |
| public concept | MoveConstructible<T> | |
| public concept | MultiplicativeGroup<T> | |
| public concept | MultiplicativeMonoid<T> | |
| public concept | MultiplicativeSemigroup<T> | |
| public concept | OrderedAdditiveGroup<T> | |
| public concept | OrderedAdditiveMonoid<T> | |
| public concept | OrderedAdditiveSemigroup<T> | |
| public concept | OrderedMultiplicativeSemigroup<T> | |
| public concept | OutputIterator<T> | |
| public concept | RandomAccessContainer<T> | A Container whose iterators are RandomAccessIterator s. |
| public concept | RandomAccessIterator<T> | An iterator that can move arbitrary offsets. |
| public concept | Regular<T> | A Semiregular type that can be compared for equality and inequality. |
| public concept | Relation<T> | A BinaryPredicate that has two parameters of the same type and provides a typedef named Domain . The domain of the relation is the type of the parameters. |
| public concept | Relation<T, U, V> | |
| public concept | Semiregular<T> | A type that can be default constructed and either copied or moved or both. |
| public concept | Semiring<T> | |
| public concept | SignedInteger<I> | |
| public concept | TotallyOrdered<T> | A Regular type whose objects can be compared with operators <, >, <= and >=. |
| public concept | TotallyOrdered<T, U> | |
| public concept | TrivialIterator<T> | An iterator is generalization of a pointer. An iterator may have limitations regarding how it can move. |
| public concept | UnaryFunction<T> | A function object whose function call operator has one parameter. |
| public concept | UnaryOperation<T> | A UnaryFunction object where the return type and the parameter type of the function call operator are the same type. |
| public concept | UnaryPredicate<T> | A Boolean-valued UnaryFunction object. |
| public concept | UnsignedInteger<U> |


The dc_graph.diagram is a dc.js-compatible network visualization component. It registers in the dc.js chart registry and its nodes and edges are generated from crossfilter groups. It logically derives from the dc.js Base Mixin, but it does not physically derive from it since so much is different about network visualization versus conventional diagraming.
Set or get the width attribute of the diagram. See .height
below. Default: 200
Set or get the height attribute of the diagram. The width and height are applied to the SVG element generated by the diagram when rendered. If a value is given, then the diagram is returned for method chaining. If no value is given, then the current value of the height attribute will be returned. Default: 200
Get or set the root element, which is usually the parent div. Normally the root is set when the diagram is constructed; setting it later may have unexpected consequences.
Get or set whether mouse wheel rotation or touchpad gestures will zoom the diagram, and whether dragging on the background pans the diagram.
Set or get the crossfilter dimension which represents the nodes (vertices) in the diagram. Typically there will be a crossfilter instance for the nodes, and another for the edges.
The node dimension currently does nothing, but once selection is supported, it will be used for filtering other charts on the same crossfilter instance based on the nodes selected.
Set or get the crossfilter group which is the data source for the nodes in the diagram. The diagram will
use the group's .all()
method to get an array of {key, value}
pairs, where the key is a unique
identifier, and the value is usually an object containing the node's attributes. All accessors work
with these key/value pairs.
If the group is changed or returns different values, the next call to .redraw()
will reflect the changes
incrementally.
It is possible to pass another object with the same .all()
interface instead of a crossfilter group.
Set or get the crossfilter dimension which represents the edges in the diagram. Typically there will be a crossfilter instance for the nodes, and another for the edges.
The edge dimension currently does nothing, but once selection is supported, it will be used for filtering other charts on the same crossfilter instance based on the edges selected.
Set or get the crossfilter group which is the data source for the edges in the diagram. See .nodeGroup
above for the way data is loaded from a crossfilter group.
The values in the key/value pairs returned by diagram.edgeGroup().all()
need to support, at a minimum,
the nodeSource
and nodeTarget
, which should return the same keys as the nodeKey
Set or get the function which will be used to retrieve the unique key for each node. By default, this
accesses the key
field of the object passed to it. The keys should match the keys returned by the
.edgeSource
and .edgeTarget
.
Set or get the function which will be used to retrieve the unique key for each edge. By default, this
accesses the key
field of the object passed to it.
Set or get the function which will be used to retrieve the source (origin/tail) key of the edge objects.
The key must equal the key returned by the .nodeKey
for one of the nodes; if it does not, or
if the node is currently filtered out, the edge will not be displayed. By default, looks for
.value.sourcename
.
Set or get the function which will be used to retrieve the target (destination/head) key of the edge objects.
The key must equal the key returned by the .nodeKey
for one of the nodes; if it does not, or
if the node is currently filtered out, the edge will not be displayed. By default, looks for
.value.targetname
.
Set or get the function which will be used to retrieve the radius, in pixels, for each node. This
determines the height of nodes, and the width, if nodeFitLabel
is false. Default: 25
Set or get the function which will be used to retrieve the stroke width, in pixels, for drawing the outline of each node. According to the SVG specification, the outline will be drawn half on top of the fill, and half outside. Default: 1
Set or get the function which will be used to retrieve the stroke color for the outline of each node. Default: black
If set, the value returned from nodeFill
will be processed through this d3.scale
to return the fill color. If falsy, uses the identity function (no scale). Default: null.
Set or get the function which will be used to retrieve the fill color for the body of each node. Default: white
Set or get the padding or minimum distance, in pixels, between nodes in the diagram. Default: 6
Set or get the function which will be used to retrieve the label text to display in each node. By
default, looks for a field label
or name
inside the value
field.
Set or get the function which will be used to retrieve the label fill color. Default: null
Whether to fit the node shape around the label. Default: true
The shape to use for drawing each node, specified as an object with at least the field
shape
: ellipse, polygon
If shape = polygon
:
sides
: number of sides for a polygonSet or get the function which will be used to retrieve the node title, usually rendered as a tooltip. By default, uses the key of the node.
By default, nodes are added to the layout in the order that .nodeGroup().all()
returns them. If
specified, .nodeOrdering
provides an accessor that returns a key to sort the nodes on.
It would be better not to rely on ordering to affect layout, but it does matter.
Specify an accessor that returns an {x,y} coordinate for a node that should be fixed in place, and returns falsy for other nodes.
Set or get the function which will be used to retrieve the stroke color for the edges. Default: black
Set or get the function which will be used to retrieve the stroke width for the edges. Default: 1
Set or get the function which will be used to retrieve the edge opacity, a number from 0 to 1. Default: 1
Set or get the function which will be used to retrieve the edge label text. The label is displayed when
an edge is hovered over. By default, uses the edgeKey
.
Set or get the function which will be used to retrieve the name of the arrowhead to use for the target/
head/destination of the edge. Arrow symbols can be specified with .defineArrow()
. Return null to
display no arrowhead. Default: 'vee'
Set or get the function which will be used to retrieve the name of the arrow tail to use for the source/
tail/source of the edge. Arrow symbols can be specified with .defineArrow()
. Return null to
display no arrowhead. Default: null
To draw an edge but not have it affect the layout, specify a function which returns false for that edge.
By default, will return false if the notLayout
field of the edge is truthy, true otherwise.
Currently, three strategies are supported for specifying the lengths of edges:
edgeLength
for each edge. If it returns falsy, uses the baseLength
When the .lengthStrategy
is 'individual', this accessor will be used to read the length of each edge.
By default, reads the distance
field of the edge. If the distance is falsy, uses the baseLength
.
Gets or sets the default edge length (in pixels) when the .lengthStrategy
is 'individual', and the base
value to be multiplied for 'symmetric' and 'jaccard' edge lengths.
Whether to highlight neighboring edges when hovering over a node. Not completely working yet. Default: false.
Gets or sets the transition duration, the length of time each change to the diagram will be animated
.timeLimit([number]) Gets or sets the maximum time spent doing layout for a render or redraw. Set to 0 for now limit. Default: 0
This function will be called with the current nodes and edges on each redraw in order to derive new layout constraints. By default, no constraints will be added beyond those for edge lengths, but this can be used to generate alignment (rank) or axis constraints. See the cola.js wiki for more details. The constraints are built from scratch on each redraw.
If there are multiple edges between the same two nodes, start them this many pixels away from the original so they don't overlap. Default: 5
By default, edges are added to the layout in the order that .edgeGroup().all()
returns them. If
specified, .edgeOrdering
provides an accessor that returns a key to sort the edges on.
It would be better not to rely on ordering to affect layout, but it does matter. (Probably less
than node ordering, but it does affect which parallel edge is which.)
Currently there are some bugs when the same instance of cola.js is used multiple times. (In particular, overlaps between nodes may not be eliminated [if cola is not reinitialized] (https://github.com/tgdwyer/WebCola/issues/118)). This flag can be set true to construct a new cola layout object on each redraw. However, layout seems to be more stable if this is set false, so hopefully this will be fixed soon.
Whether to perform layout when the data is unchanged from the last redraw. Default: false
When layoutUnchanged
is false, call this when changing a parameter in order to force layout
to happen again. (Yes, probably should not be necessary.)
By default, all nodes are included, and edges are only included if both end-nodes are visible.
If .induceNodes
is set, then only nodes which have at least one edge will be shown.
If it is desired to modify the cola layout object after it is created, this function can be called to add a modifier function which takes the layout object.
If this flag is true, the positions of nodes and will be updated while layout is iterating. If false, the positions will only be updated once layout has stabilized. Note: this may not be compatible with transitionDuration. Default: false
Assigns a legend object which will be displayed within the same SVG element and according to the visual encoding of this diagram.
Specifies another kind of child, e.g. tooltip control.
Instructs cola.js to fit the connected components. Default: false
Computes a new layout based on the nodes and edges in the edge groups, and displays the diagram.
To the extent possible, the diagram will minimize changes in positions from the previous layout.
.render()
must be called the first time, and .redraw()
can be called after that.
.redraw()
will be triggered by changes to the filters in any other charts in the same dc.js
chart group.
Erases any existing SVG elements and draws the diagram from scratch. .render()
must be called
the first time, and .redraw()
can be called after that.
Attaches an event handler to the diagram. Currently the only diagram event is end
, signalling
that diagram layout has completed.
Returns an object with current statistics on graph layout.
nnodes
- number of nodes displayednedges
- number of edges displayedExecute a d3 single selection in the diagram's scope using the given selector and return the d3 selection. Roughly the same as
d3.select('#diagram-id').select(selector)
Since this function returns a d3 selection, it is not chainable. (However, d3 selection calls can be chained after it.)
Selects all elements that match the d3 single selector in the diagram's scope, and return the d3 selection. Roughly the same as
d3.select('#diagram-id').selectAll(selector)
Since this function returns a d3 selection, it is not chainable. (However, d3 selection calls can be chained after it.)
Returns the top svg element for this specific chart. You can also pass in a new svg element, but setting the svg element on a diagram may have unexpected consequences.
Remove the diagram's SVG elements from the dom and recreate the container SVG element.
Creates an svg marker definition for drawing edge arrow tails or heads.
id
to give the marker. When this identifier is returned by .edgeArrowhead
or .edgeArrowtail
, that edge will be drawn with the specified marker for its source or target.drawf - a function to draw the marker using d3 SVG primitives, which takes the marker object as
its parameter. The viewBox
of the marker is 0 -5 10 10
, so the arrow should be drawn from (0, -5)
to (10, 5) and it will be moved and sized based on the other parameter, and rotated based on the
orientation of the edge.
For example, the built-in vee
arrow is defined so:
_chart.defineArrow('vee', 12, 12, 10, 0, function(marker) {
marker.append('svg:path')
.attr('d', 'M0,-5 L10,0 L0,5 L3,0')
.attr('stroke-width', '0px');
});
(If further customization is required, it is possible to append other `svg:defs` to `chart.svg()`
and use refer to them by `id`.)
The dc_graph.legend will show labeled examples of nodes (and someday edges), within the frame of a dc_graph.diagram.
Set or get x coordinate for legend widget. Default: 0.
Set or get y coordinate for legend widget. Default: 0.
Set or get gap between legend items. Default: 5.
Set or get legend node width. Default: 30.
Set or get legend node height. Default: 30.
Specifies an object where the keys are the names of items to add to the legend, and the values are objects which will be passed to the accessors of the attached diagram in order to determine the drawing attributes. Alternately, if the key needs to be specified separately from the name, the function can take an array of {name, key, value} objects.
Assigns this tip object to a diagram. It will show tips for nodes in that diagram.
Specifies the function to generate content for the tooltip. This function has
the signature function(d, k)
, where d
is the datum of the node being hovered over,
and k
is a continuation. The function should fetch the content, asynchronously
if needed, and then pass it forward to k
.


ERROR_STATE
FunctionReturns the error state set by the last THROW
statement.
ERROR_STATE()
The last error state. This value may be of any type (not just numeric).
BEGIN TRYPrints 0.
THROW 123, 'Message', 0;
END TRY
BEGIN CATCH
PRINT ERROR_STATE();
END CATCH;


This is a simple static website being served from Nginx running inside a Docker container!
Thank You
Meet Shah


Warehouse Keeper Sorint:
I hereby acknowledge your indomitable will and tenacious spirit. On behalf of our coin collectors guild, I promote you to level 2. Congratulations!