This is a short introduction to the GUI tookit RSSGui which is a simple and easy to use C++ wrapper for the ANSI C GUI toolkit IUP.
The current version of RSSGui is 0.5. This release contains wrappers for most of the IUP widgets and adds a widget type that can be used to create wizards. Not all events and functions availabe in IUP are already wrapped by RSSGui, but the event handling mechanism is very simple and easy to extend. If you miss somethin, please tell me. The current version is only tested on the Windows platform. If you can successfully use it on any other platform or if you have any problems anywhere, please tell me!
I know a lot of C++ GUI toolkits. Most of them have some drawbacks: Either they come with a lot of classes that represent strings, lists, vectors etc. which are already defined in a wunderful way in the C++ STL, they don't use native widgets or they have a complicated and error prone event handling (like MFC or wxWidgets) or they use language extensions (like Qt). So my goals when designing RSSGui where:
Simplicity
- STL conformance, compatibility and interoperability
- A simple yet powerful event handling mechanism
- Native C++, no language extensions
- Completely free for comeracial as for non comercial usage
I think I reached these goals quite good. The event handling is really simple and easy to understand as well as easy to use. Unfortunately it is not typesafe. It could have been realized in a type safe way as I saw it in a signal and slot library that I found on the web. But, well - I don't consider type safety as a primary design goal, so I am happy with the current design.
If you are still interested in using RSSGui for your applications, please have a look at the following examples...
The only file you need to include is
RSSGui.h
. You don't need to include any IUP headers if you don't want to use IUP functions directly. At the beginning of your program you should call the functionrssGuiInit()
and at the endrssGuiRelease()
. Just by the way: You can use IUP functions directly on your RSSGui widgets - you can receive a widget pointer by calling the methodgetHandle()
and cast the returned pointer fromvoid *
toIhandle *
, but this is not really tested or suggested...
This simple example creates a dialog, places a button on it and starts the main event loop (but doesn't use an event handler):
#include "RSSGui.h" int main() { rssGuiInit(); // create a dialog with a simple button RSSButton *b1 = new RSSButton("Click me!"); RSSDialog *d1 = new RSSDialog(b1, "RSSGui Example"); // set a tool tip for the button b1->setToolTip("A cool button"); // show the dialog d1->show(); // Start the main event loop RSSEventManager *eventManager = RSSEventManager::getInstance(); eventManager->mainLoop(); delete d1; rssGuiRelease(); return 0; }The button gets a tool tip simply by calling the method
setToolTip()
that is inherited fromRSSWidget
.
#include "RSSGui.h" class MyDialog : RSSEventHandler { public: int button1Event(RSSEvent &event) { static int flag = 0; flag = 1 - flag; // toggle between 0 and 1 ((RSSButton *)(event.getWidget()))->setLabel(flag ? "text1" : "text2"); return RSSGUIDEFAULT; } int button2Event(RSSEvent &event) { return RSSGUICLOSE; } void doIt() { // create a dialog with a simple button RSSButton *b1 = new RSSButton("Button 1"); RSSButton *b2 = new RSSButton("Close"); RSSVBox *v1 = new RSSVBox(b1, b2, 0); RSSDialog *d1 = new RSSDialog(v1, "RSSGui Example"); // set tool tips for the buttons b1->setToolTip("A cool button"); b2->setToolTip("Close this wunderful application"); // show the dialog d1->show(); // register the event handlers rssRegisterEvent(b1, MyDialog::button1Event); rssRegisterEvent(b2, MyDialog::button2Event); // Start the main event loop RSSEventManager *eventManager = RSSEventManager::getInstance(); eventManager->mainLoop(); delete d1; } }; int main() { rssGuiInit(); MyDialog d; d.doIt(); rssGuiRelease(); return 0; }
An event handler is a method in a class that is derived from
RSSEventHandler
. All event handlers are methods that receive an argument of typeRSSEvent
and that return an integer value. This return value controls if the application should be continued or terminated etc. - exactly as in IUP itself. The class RSSEvent has a lot of member functions that you can use to access information about the event. For example you can use the methodgetWidget()
to access the widget that caused the event - in this case the button that has been clicked.The idea of the event handling mechanism is really simple - call the macro
rssRegisterEvent
and connect an event handler to an event type of a widget. That's it. No magic macros in your headers that are similarly repeated in the implementation files and no language extension. Simply calling a macro to connect the event and the event handler.
The project RSSGui is not officially supported. But if you have any problems, need any missing features or just want to talk about the system, don't hesitate to contact me.
RSSGui is distributed under the same license conditions as IUP itself. This means that you can use it in modified or unmodified form for any comercial and non comercial purpose. You should mention the copyright notice of the IUP project and additionally the following copyright notice somewhere in your program or in your documentation and you should put a Tecgraf and a Reinhold Software Services logo somewhere on your website:
RSSGui (C) 2005 by Reinhold Software Services
RSSGui is developed and sponsored by Reinhold Software Services.


This area is reserved to the verification of digital signed documents, using a public key. To verify a signature, just:
Upload your files;
Select the resume algorithm for your signature;
Select the original file to verify;
Select the signature file to verify;
Select the public key used in the verification;
Click on verify file;
Digital signatures are the best way to deploy a unique signature to your files, directly linking them only to the properties of your secret keys.
That means that only the ones who have your public key can check if you signed the document.
A slightly change on the original document or signature, will produce a total different output.


Work1
Games Games Games
A collection of games I've created from the Odin Project
A collection of games I've created from the Odin Project
Create a sample landing page using bootstrap
A portfolio website to showcase your work
A commercial page to use for products or idea
This is a one page company website example
I'm a junior front end web developer. I like to build websites and uses the latest technologies to create simple, but elegant website; rich and interactive, but fast-performing. You can reach out to me at:


Welcome Admin
List of Essays Uploaded
Name
Email
Phone
Download
Rank
{{document}}
Download
Declare Result
Invalid Ranks


Sign Up
×
Please Fill the fields
Name
last Name
E-Mail
Password
Birth Date
Payment Method
Card Number
Card Type
Debit Card
Credit Card
Expired
CCV
Address
ZIP
City
street
street Number
Sign Up


Yes I know my enemies Rage Against The Machine - Rage Against The Machine - Know Your Enemy
They are the teachers who taught me to fight me
Compromise, conformity, assimulation, submission
Ignorance, hypocrisy, brutality, the elite
All of which are American dreams..


No worries! We are here to help you to reset your account's password. Click the button below to get started


| Forum | Last active topic |
|---|---|
| Beginners Discussions about C++ programming for beginners | "Investment program" on by firedraco |
| Windows Programming Win32, MFC, ATL, C++/CLI, .NET ... | "Error C2036 (unknown size) when creating default structure" on by EssGeEich |
| UNIX/Linux Programming Programming C++ for UNIX and Linux | "Problem Including OpenCL library" on by blackbird8192 |
| General C++ Programming Anything about programming in C++ | "Why is my string outputting twice? " on by sirlukepotter |
| Lounge Discussions about this website, or other topics not related to C++ programming | "Is it possible to convert a NON-BOOTABLE dvd into a BOOTABLE dvd?" on by geniusberry |
| Jobs Job offers for C++ programmers. | "[Remote] C++ Programmers" on by X1Zezeri |
| Articles How-to's and other technical articles | "How to Make a Game 2" on by Xander314 |


Attn: Good Morning, I am Professor Frank Morris a British Citizen working with the Stanbic Bank of Ghana as the General Auditor, I what to inform you about this situation we have here in Ghana to know if you are interested and capable of handling the transaction. There is an account opened in this bank in 1990 and since my Inception into office in 2001, and nobody has operated on this account. I have the courage to look for a reliable and honest person who will be capable for this transaction? The owner of this account is Mr.William Kim, the General Manager of Fidelity Investments International Company LTD UK, The World Leading Investment & Funds Management Institutions that has Over $3.2 TrillionUS United State Dollars as Capital Investment Funds here in Ghana, he died since 1995.the amount involved is $100Million United State Dollars. If you are interested and capable of this transaction please get back to me with your tell phone and fax numbers.or give me a call at (+23)<PHONE_NUMBER>0 Regards, Professor Frank Morris.


Never leave... the beach!
home
|
accommodations
|
activities
|
contact information
|
pictures
|
travel arrangements
Welcome to FruitNet's destinations page. Please, browse our links!


| Home | Libraries | People | FAQ | More |
boost::program_options::value_semantic
// In header: <boost/program_options/value_semantic.hpp> class value_semantic { public: // construct/copy/destruct ~value_semantic(); // public member functions std::string name() const; unsigned min_tokens() const; unsigned max_tokens() const; bool is_composing() const; bool is_required() const; void parse(boost::any &, const std::vector< std::string > &, bool) const; bool apply_default(boost::any &) const; void notify(const boost::any &) const; };
Class which specifies how the option's value is to be parsed and converted into C++ types.
value_semantic
public member functionsstd::string name() const;
Returns the name of the option. The name is only meaningful for automatic help message.
unsigned min_tokens() const;
The minimum number of tokens for this option that should be present on the command line.
unsigned max_tokens() const;
The maximum number of tokens for this option that should be present on the command line.
bool is_composing() const;
Returns true if values from different sources should be composed. Otherwise, value from the first source is used and values from other sources are discarded.
bool is_required() const;
Returns true if value must be given. Non-optional value
void parse(boost::any & value_store, const std::vector< std::string > & new_tokens, bool utf8) const;
Parses a group of tokens that specify a value of option. Stores the result in 'value_store', using whatever representation is desired. May be be called several times if value of the same option is specified more than once.
bool apply_default(boost::any & value_store) const;
Called to assign default value to 'value_store'. Returns true if default value is assigned, and false if no default value exists.
void notify(const boost::any & value_store) const;
Called when final value of an option is determined.


Can't get to Laracon? You're in luck!
First thing this morning (a little past midnight UK time), a guy by the name of Chris Borgia posted a campaign on indiegogo. The campaign, “Film Laracon” is pretty self-explanatory. In the project summary he pointed out that there were no plans for the talks to be recorded, meaning those of us unable to attend Laracon would be left out of the mix. As it happens, Chris already owns the relatively wide range of gear necessary to record a conference and he’d managed to secure a slot on the guest list, so all he had to cover was the cost of a hotel and parking at a total of $560.
Can’t make it to #laracon? We can record videos of the talks, but we need a little extra help from you! Lend a hand? igg.me/at/laracon
February 7, 2013 As someone living in the UK without a Passport I didn’t have a hope in hell of actually being there, even if I wanted to be. With that in mind, when I saw @laravelphp’s tweet, I had to do something about it. $20 was enough to get me early access to the recordings via FTP; translate that to real money (GBP) and you’re left with about 13 quid. I’m not generally the superstitious type but hey, I didn’t wanna jinx it so I rounded up to 25 anyway.
I made my donation at 00:19. After that, a couple more people donated as you’d expect. Then someone came along and threw in no less than two hundred and fifty dollars. Yeah, you read that right. I won’t give their name because they changed the privacy setting to not disclose the amount, but they deserve a bloody medal.
Needless to say, their very generous donation brought the running total to be $6 short of the target. I took to IRC to say “Holy crap!” but someone else had already seen the donation.  In the mean time, the odd number was driving me crazy so the race was on to donate that final 6 dollars.
Long story short, in the 25 minutes since going live, the campaign had already reached its goal. Looks like a few others had the same idea as me though - by 30 minutes the total was almost $100 over the initial target. Amazing what difference a community can make!
So thanks to Chris, the indiegogo contributors and of course the organisers for letting him in, we’ll all be able to watch the conference from the comfort of our armchairs (or office chairs) as and when we want. For those of you that can’t donate for whatever reason or didn’t opt for early access, videos will likely be released daily, one talk at a time.
As I sit here typing this now at 04:30, the pot is overflowing by 345USD, thus bringing the total to $906. Kinda makes me wish I didn’t donate that extra 6 dollars now… There’s still plenty of time to contribute though. If you want to be credited, get first dibs on the footage or even just say “thanks” with your wallet, Let’s Film Laracon is “open” ‘til 13th February (next Wednesday).


import cv2
import glob
images=glob.glob("*.jpg")
for image in images:
img=cv2.imread(image,0)
re=cv2.resize(img,(100,100))
cv2.imshow("Hey",re)
cv2.waitKey(500)
cv2.destroyAllWindows()
cv2.imwrite("resized_"+image,re)
As you can see, Ifirst created a list containingthe image file paths and then iterated through that list.
The loop reads each image, resizes, displays,waits for the user input key, closes the window once the key is pressed and then writes the resized image under the existing file name together with the "resized" prefix.


There is no consensus for a core library, portable across Prolog systems, let alone a standard for such a library. Since SICStus Prolog 3 was first released, SICS has acquired Quintus Prolog, which has a rather rich library. For release 4, we have decided to make this asset be available to the SICStus community by providing a library that is a merger of the previous SICStus and Quintus libraries, which already overlap significantly.
The User's Manual documents the library of release 4. For the purposes of aiding code transition to release 4, the following is a list of the release 3 library modules, and their fate in release 4. See also Guide to Porting Code from Release 3.
atts
comclient
fdbg
gauge
heaps
linda/client
linda/server
pillow
prologbeans
tcltk
timeout
trees
wgraphs
xml
arrays
library(logarr)
.
Also available is a deprecated compatibility module library(arrays3)
.
assoc
library(avl)
,
reflecting the abstract data type, AVL trees, and with a modified,
richer API. Also available is a deprecated compatibility module
library(assoc3)
.
bdb
charsio
library(codesio)
in release 4.
Likewise, the syllable `chars' has been renamed to `codes'
in predicate names.
clpq
clpr
clpfd
automaton/8
minimum/2
maximum/2
nvalue/2
cumulative/[1,2]
serialized/[2,3]
and cumulative/[4,5]
.
table/[2,3]
relation/3
.
all_different/[1,2]
all_distinct/[1,2]
scalar_product/[4,5]
knapsack/3
.
global_cardinality/[2,3]
count/4
.
fd_copy_term/3
copy_term/3
.
jasper
Jasper
module is not available in the current
release. An alternative for Java users is PrologBeans.
lists
library(lists3)
.
ordsets
queues
library(queues3)
.
random
library(random3)
.
sockets
socket_client_open/3
subsumes socket/2
and socket_connect/3
.
socket_server_open/2
subsumes socket/2
,
socket_bind/2
and socket_listen/2
.
socket_select/7
can wait for any kind of stream, not just socket
streams. socket_select/7
waits until one unit (character for
text streams, byte for binary streams) can be transferred.
socket_select/7
can wait for streams ready to write.
socket_select/7
does not create streams, you need to explicitly
use socket_server_accept
.
Socket streams are binary by default.
Blocking socket operations can be interrupted on both UNIX and Windows.
library(sockets)
should work with IPv6.
system
library(file_systems)
. Process primitives have been redesigned
and moved to a new module, library(process)
. The predicates for
creating temporary files, mktemp/2
and tmpnam/1
, have been
removed. They used C library functionality that is broken by design and
insecure. Instead, to create and open a temporary file use something
like open(temp('foo'), write, S,
[if_exists(generate_unique_name)])
, possibly together with
stream_property(S, file_name(Path))
if you need to know the path
to the generated file name.
The (little) remaining functionality is largely as in release 3.
Also available is a deprecated compatibility module library(system3)
.
terms
term_hash/2
is not guaranteed to compute the same hash values as in release 3.
ugraphs
objects
library(objects)
.
chr
library(chr)
,
based on the Leuven implementation.
clpb
flinkage
spaceout
vbsp
The following is a list of library modules that are new in release 4.
aggregate
assoc
bags
between
file_systems
objects
library(structs)
.
process
rem
samsort
sets
structs
library(objects)
.
types
varnumbers
numbervars/3
.


CSS only popup
| Name | Major | Sex | English | Japanese | Calculus | Geometry |
|---|---|---|---|---|---|---|
| Name | Major | Sex | English | Japanese | Calculus | Geometry |
| Student03 | Languages | female | 85 | 95 | 80 | 85 |
| Student04 | Languages | male | 60 | 55 | 100 | 100 |
| Student05 | Languages | female | 68 | 80 | 95 | 80 |
| Student12 | Mathematics | female | 100 | 75 | 70 | 85 |
| Student13 | Languages | female | 100 | 80 | 100 | 90 |
| Student14 | Languages | female | 50 | 45 | 55 | 90 |
| Student15 | Languages | male | 95 | 35 | 100 | 90 |
| Student16 | Languages | female | 100 | 50 | 30 | 70 |
| Student17 | Languages | female | 80 | 100 | 55 | 65 |
| Student18 | Mathematics | male | 30 | 49 | 55 | 75 |
| Student19 | Languages | male | 68 | 90 | 88 | 70 |
| Student20 | Mathematics | male | 40 | 45 | 40 | 80 |
| Student01 | Languages | male | 80 | 70 | 75 | 80 |
| Student02 | Mathematics | male | 90 | 88 | 100 | 90 |
| Student06 | Mathematics | male | 100 | 99 | 100 | 90 |
| Student07 | Mathematics | male | 85 | 68 | 90 | 90 |
| Student08 | Languages | male | 100 | 90 | 90 | 85 |
| Student09 | Mathematics | male | 80 | 50 | 65 | 75 |
| Student10 | Languages | male | 85 | 100 | 100 | 90 |
| Student11 | Languages | male | 86 | 85 | 100 | 100 |
Bootstrap Popover
| Rank | First Name | Last Name | Age | Total | Discount | Date |
|---|---|---|---|---|---|---|
| 1 | Philip Aaron Wong | Johnson Sr Esq | 25 | $5.95 | 22% | Jun 26, 2004 7:22 AM |
| 11 | Aaron | Hibert | 12 | $2.99 | 5% | Aug 21, 2009 12:21 PM |
| 12 | Brandon Clark | Henry Jr | 51 | $42.29 | 18% | Oct 13, 2000 1:15 PM |
| 111 | Peter | Parker | 28 | $9.99 | 20% | Jul 6, 2006 8:14 AM |
| 21 | John | Hood | 33 | $19.99 | 25% | Dec 10, 2002 5:14 AM |
| 013 | Clark | Kent Sr. | 18 | $15.89 | 44% | Jan 12, 2003 11:14 AM |
| 005 | Bruce | Almighty Esq | 45 | $153.19 | 44% | Jan 18, 2021 9:12 AM |
| 10 | Alex | Dumass | 13 | $5.29 | 4% | Jan 8, 2012 5:11 PM |
| 16 | Jim | Franco | 24 | $14.19 | 14% | Jan 14, 2004 11:23 AM |
| 166 | Bruce Lee | Evans | 22 | $13.19 | 11% | Jan 18, 2007 9:12 AM |
| 100 | Brenda Dexter | McMasters | 18 | $55.20 | 15% | Feb 12, 2010 7:23 PM |
| 55 | Dennis | Bronson | 65 | $123.00 | 32% | Jan 20, 2001 1:12 PM |
| 9 | Martha | delFuego | 25 | $22.09 | 17% | Jun 11, 2011 10:55 AM |


Running Bionic Pancreas Offline
The web app has been setup to be accesible offline. The browser will save the app into its cache after first visiting the url labs-server.tidepool.io:8087. An alert will infrom you when the app is availabe to use offline.
Add to home screen on an Android device
- Open labs-server.tidepool.io:8087 on the Chrome Web Browser
- Click top dropdown on the top bar. Select add to homescreen
- Navigate your applications and find the Bionic Pancreas app
Mirror App to Yota phone e-paper when online
- Start the bionic pancreas app
- Press and hold the Home button. Three choices will showup. Slide your finger to the left most icon
- Flip the phone to find the homescreen mirrored on the epaper screen
The server, http://labs-server.tidepool.io, hosts tidepool labs homepage along with all its projects.
Mirror App to Yota phone E-paper screen when offline
- Start in the device home screen
- Press and hold the Home button. Three choices will showup. Slide your finger to the left most icon
- Flip the phone to find the homescreen mirrored on the epaper screen
- Start the bionic pancreas app


Welcome Tejas AKA raspgary
Dashboard
About
Usage
Shower
Light
Rewards
Logout
Rewards Points:
JAN
This month's projected energy bill:
JAN
This month's projected water bill:
Environmental Score
Did You Know?
If you use a low-flow showerhead, you can save 15 gallons of water during a 10-minute shower.
Environmental Impact Breakdown
Average Shower Time


Back to: ← Installing the code components
Ensembl is built on the following applications:
These applications are not version-specific for Ensembl; that is, if you upgrade your Ensembl installation to a newer version when one becomes available, you probably won't need to install new versions of these applications.
All of this software, like all of Ensembl, is Open Source software and can be downloaded and used free of charge. You should, however, check the documentation for each application to see what license it has been released under, particularly if you are installing Ensembl in a commercial environment.
The following instructions assume you have root access to the installation machine. If you do not, get your systems administrator to install this software for you.
You may have some or all of this software installed already. If you have any problems getting the site running with pre-installed software (in particular Apache with mod_perl installed from RPMs), we recommend simply installing the latest version using the following instructions.
CVS is a software version control system that we use for storing the source code to Ensembl. You will need CVS installed if you want to download the Ensembl source code. It will also help you keep up to date with any bug fixes. We also have a Web-based CVS repository.
gunzip < cvs-1.11.22.tar.gz | tar xvf - cd cvs-1.11.22 ./configure make make install
You will probably already have Perl installed. You need Perl5, version 5.8.0 or higher to run the website. We run the site under Perl 5.8.7. To see if you have Perl installed, and/or to check it's version number, type:
perl -v
If you don't have Perl installed, or need to upgrade, go to http://www.cpan.org/ and choose the 'source code' install. Follow the installation instructions on the web site.
MySQL is a very popular Open Source relational database system. The easiest way to install MySQL is to use the pre-compiled binaries from http://dev.mysql.com. You can also get source from http://dev.mysql.com if you wish to compile MySQL yourself.
$ gunzip < mysql-WHATEVER.tar.gz | tar xvf -Follow the straightforward setup instructions in the INSTALL-BINARY file that comes with MySQL. It should be located in the "mysql-WHATEVER" directory you just unpacked.
Apache is the web server that the Ensembl site runs on. mod_perl is a module for Apache that enables it to compile perl scripts once rather than each time they are requested, and so makes everything run a lot faster.
Please follow these instructions precisely as often the default version of Apache or mod-perl does not work correctly for Ensembl.
tar zxf httpd-2.2.4.tar.gz tar zxf mod_perl-2.0.3.tar.gz | tar xvf - cd httpd-2.2.4 ./configure --enable-deflate --prefix=Apache directory cd ../mod_perl-2.0.3The httpd.conf files etc assume you install this in an apache2 subdirectory of your website's server root.
perl Makefile.PL PREFIX=Apache directory MP_APXS=Apache directory/bin/apxs
make
make install
The Ensembl website needs quite a few Perl modules to be installed in order for it to run. These modules can all be downloaded from www.cpan.org, and are all installed in much the same way: Download the module tarball, unpack in a working directory, and install the module:
gunzip < module.tar.gz | tar xvf - cd module perl Makefile.PL make make test make install
The modules that are required are listed below, along with their URLs. The file part of the URL is current at the time of writing - you should install whatever is the latest version of the module.
Lightweight DAS fetcher
http://www.cpan.org/modules/by-module/Bio/Bio-Das-Lite-1.48.tar.gz
A distributed-memory object caching system, for performance enhancement
http://www.cpan.org/modules/by-modules/Cache/Cache-Memcached-1.24.tar.gz
Enables Perl scripts to easily parse cgi
http://www.cpan.org/modules/by-module/CGI/CGI.pm-3.27.tar.gz
NOTE: you need to install the latest version to make sure it is compatible with mod_perl2
Used by BioMart
http://www.cpan.org/modules/by-modules/CGI/CGI-Ajax-0.697.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/CGI/CGI-Session-4.14.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Class/Class-Accessor-0.27.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Class/Class-Data-Inheritable-0.06.tar.gz
Database abstraction layer, used to access non-genomic databases such as ensembl_website
http://www.cpan.org/modules/by-modules/Class/Class-DBI-Sweet-0.09.tar.gz
Used by BioMart and new session code
http://www.cpan.org/modules/by-modules/Class/Class-Std-v0.0.8.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Class/Class-Std-Utils-0.0.2.tar.gz
A compression module for DAS.
http://www.cpan.org/modules/by-module/Compress/Compress-Zlib-1.34.tar.gz
A compression module for Mart.
http://www.cpan.org/modules/by-module/Compress/Compress-Raw-Zlib-2.003.tar.gz
Used by the registry
http://www.cpan.org/modules/by-module/Config/Config-IniFiles-2.38.tar.gz
Creates a unique ID
http://www.cpan.org/modules/by-module/Data/Data-UUID-0.11.tar.gz
Used by Mart
http://www.cpan.org/modules/by-modules/DB_File/DB_File-1.814.tar.gz
A common database interface for Perl
The MySQL drivers for the DBI interface
http://www.cpan.org/modules/by-module/DBD/DBD-mysql-4.001.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Devel/Devel-StackTrace-1.13.tar.gz
calculates a unique checksum for a file
http://www.cpan.org/modules/by-module/Digest/Digest-MD5-2.33.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Exception/Exception-Class-1.23.tar.gz
Used by MartView
http://www.cpan.org/modules/by-module/File/File-Temp-0.14.tar.gz
A Graphics library
Note: may require additional modules. Please read install docs.
Used to merge data from multiple configuration files
http://www.cpan.org/modules/by-modules/Hash/Hash-Merge-0.10.tar.gz
Used by BlastView
http://www.cpan.org/modules/by-module/HTML/HTML-Template-2.7.tar.gz
Used for getting size of images
http://www.cpan.org/modules/by-module/Image/Image-Size-2.992.tar.gz
Used for sequence handling
http://www.cpan.org/modules/by-module/IO/IO-String-1.06.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/XML/libxml-perl-0.08.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/List/List-MoreUtils-0.22.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Log/Log-Log4perl-1.07.tar.gz
used by DAS to communicate with DAS sources
Note: may require additional modules. Please read install docs.
http://www.cpan.org/modules/by-module/LWP/libwww-perl-5.805.tar.gz
Allows for parallel requests
http://www.cpan.org/modules/by-module/LWP/ParallelUserAgent-2.57.tar.gz
Used by web forms to send email
http://www.cpan.org/modules/by-module/Mail/MailTools-1.66.tar.gz
Used by drawing code
http://www.cpan.org/modules/by-module/Math/Math-Bezier-0.01.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Number/Number-Format-1.52.tar.gz
Used for exporting Excel spreadsheets
http://www.cpan.org/modules/by-module/OLE/OLE-Storage_Lite-0.11.tar.gz
used by Excel exporter
http://www.cpan.org/modules/by-module/Parse/Parse-RecDescent-1.94.tar.gz
Used for architecture independent file path manipulation
http://www.cpan.org/modules/by-module/File/PathTools-3.09.tar.gz
used by Image exporter for exporting as PDF
http://www.cpan.org/modules/by-module/PDF/PDF-API2-0.40.86.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Readonly/Readonly-1.03.tar.gz
used by DAS to communicate with DAS sources
Note: may require additional modules. Please read install docs.
http://www.cpan.org/modules/by-module/SOAP/SOAP-Lite-0.60a.tar.gz
used for exporting Excel spreadsheets
http://www.cpan.org/modules/by-module/Spreadsheet/Spreadsheet-WriteExcel-2.12.tar.gz
used to store and restore data structures (part of standard Perl distribution)
http://www.cpan.org/modules/by-module/Storable/Storable-2.13.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Sub/Sub-Uplevel-0.14.tar.gz
Used by website startup process
http://www.cpan.org/modules/by-modules/Sys/Sys-Hostname-Long-1.4.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Template/Template-Plugin-Number-Format-1.01.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Template/Template-Toolkit-2.15.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Test/Test-Exception-0.24.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/Test/Test-Simple-0.66.tar.gz
Used for code profiling
http://www.cpan.org/modules/by-module/Time/Time-HiRes-1.66.tar.gz
Required by Class::Std
http://search.cpan.org/CPAN/authors/id/J/JP/JPEACOCK/version-0.68.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/XML/XML-DOM-1.44.tar.gz
used by DAS to parse DAS sources
Note: module is a wrapper around the expat library, which should be installed first:
Download the expat source from http://sourceforge.net/projects/expat/. Get the latest version (currently expat-1.95.8.tar.gz). Run the following commands:
gunzip < expat-1.95.8.tar.gz | tar xvf - cd expat-1.95.8 ./configure make make install
http://www.cpan.org/modules/by-module/XML/XML-Parser-2.34.tar.gz
Used by BioMart
http://www.cpan.org/modules/by-modules/XML/XML-RegExp-0.03.tar.gz
RSS parser, used to embed Ensembl blog entries on home page
http://www.cpan.org/modules/by-modules/XML/XML-RSS-1.33.tar.gz
used by Mart to parse configuration
http://www.cpan.org/modules/by-module/XML/XML-Simple-2.14.tar.gz
The Ensembl website contains a page called DotterView which displays a graphical dotplot comparison of two sequences, using the application Dotter. If you wish to use this page on a local installation you will need a local Dotter binary:
Dotter is part of the AceDB package available at:
http://www.acedb.org/Software/Downloads/supported.shtml
Pre-built binaries are available for alpha/Tru64 unix and intel/linux. All other flavours will have to be built from sources.
The acedb code makes use of the GTK graphics and GNU readline packages. If you don't have these on your system you can either install them yourself or use the copies distributed with the acedb source.
To install them go to
www.gtk.orgfor the GTK package and
ftp://ftp.cwru.edu/pub/bash/readline-4.3.tar.gzfor readline.
Follow the GTK and GNU instructions for installing these packages.
If you want to use the versions distributed with the acedb source then follow the instructions for making them in the next section.
Next ungzip/untar the acedb package into an temporary directory:
mkdir acedb mv ACEDB-source.4_9l.tar.gz ./acedb/ cd ./acedb gzip -d < ACEDB-source.4_9l.tar.gz | tar xvf -
Set an environment variable to tell the build process what platform you are building on - one of:
ALPHA_4 ALPHA_4_GCC ALPHA_4_GCC_OPT ALPHA_4_LINUX ALPHA_4_OLDSTYLE ALPHA_4_OPT ALPHA_5 ALPHA_CHRONO_4For example (in csh):
setenv ACEDB_MACHINE SOLARIS_4
Consult the AceDB documentation if you need more help.
If you wish to use the GTK/readline packages distributed with acedb you should build them before building any acedb code:
make gnulibs
To build the dotter binary issue the command:
make dotter
(If you just run "make" you will build the whole of AceDB - which is unnecessary).
The build will place the executable at:
./bin.${ACEDB_MACHINE}/dotter
Check that the binary runs properly and then copy it to your Ensembl shared binaries directory. DotterView should now work.
Back to: ← Installing the code components


Do not build monolithic frontends to have framework flexibility!


Bootstrap has a few easy ways to quickly get started, each one appealing to a different skill level and use case. Read through to see what suits your particular needs.
Install and manage Bootstrap's Less, CSS, JavaScript, and fonts using Bower.
$ bower install bootstrap
Community members have translated Bootstrap's documentation into various languages. None are officially supported and they may not always be up to date.
We don't help organize or host translations, we just link to them.
Finished a new or better translation? Open a pull request to add it to our list.


 In this section you will have a chance to prove that. You will have to provide the right parent of a given Greek god.
You will have 8 seconds to answer each question. Capitalization does not matter but spelling does. Click on the start button to get started


Abelhas (aka Lua PSO) is a Lua library for particle swarm optimization (PSO), a population-based stochastic optimization algorithm inspired by the social behavior of some species, like bees, fishes, and birds, and used for solving a multitude of numeric problems with linear and discrete search spaces. The first particle swarm optimization algorithm was invented by Dr. James Kennedy and Russell Eberhart in 1995 and since then several versions and variants have been created. Abelhas is one of them.
For people familiarized with particle swarms, Abelhas is a particle swarm optimizer that uses global neighborhood, speed limits and particle replacement. It does not have the concept of inertia.
The solver may be seen as being a multi-dimensional solution space, where each dimension gives the value of one variable from the problem. The problem is initialized by randomly placing some number of "particles" (candidate solutions) in this search space. Each particle are ranked with a fitness function and will remember is own best position ("pbest") on the search space and will be able to "see" the best particle in the swarm ("gbest") and accelerate itself towards an intermediate position between its own best position and the position of the best particle in the swarm. This step is repeated for each particle in the swarm until some termination criteria is met (maximum fitness reached, maximum number of iterations or too many iterations without any improvement in the fitness of the best particle of the swarm). When this criterion is met, it is said that the problem converged to a solution.
In order to get the algorithm to work, several parameters must be supplied:
More information are available in the section related to the Abelhas API.
There are several references to PSO in the literature that may provide a good understanding of theses concepts. Follows a small selection:
Abelhas is copyrighted free software distributed under the same license that Lua 5.1, so, if you can use Lua in your application, you can use Abelhas too. The full license text follows:
Abelhas (c) 2005-2012 Alexandre Erwin Ittner Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHOR OR COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. If you use this package in a product, an acknowledgment in the product documentation would be greatly appreciated (but it is not required).
All current development is done in GitHub. Code contributions are welcome! Just fork the repository and send me a pull request or e-mail me a patch.
Abelhas is a pure-Lua library and can be downloaded from the
download page
in GitHub. After downloading, just unpack the distribution package and
copy the file pso.lua
to the Lua packages directory in your
system.
Some old tarballs are also archived in Luaforge but all new releases are done in GitHub.
It is also possible to install Abelhas using
Lua Rocks. If you have LuaRocks installed
in your system, just type luarocks install abelhas
in the
shell.
Abelhas uses the Lua 5.1 package system that allows you to simply do a
local pso = require("pso")
call to load up the library.
This constant keeps a string with the version of the library.
These constants keeps reasons for the termination of the algorithm, returned by the method 'run'.
Constructor. Returns a new swarm with the given number of dimensions.
Sets the precision for all dimensions (in number of decimal places). 'nil' disables this feature and allows the values to assume the maximum precision allowed by the Lua numbers.
Sets the precision for the dimension 'dim', for 'decs' decimal places. 'nil' disables this feature and allows the values to assume the maximum precision allowed by the Lua numbers.
Returns the precision for the dimension 'dim', as the number of decimal places.
Sets the cognitive factor (number, 0 or greater).
Returns the cognitive factor (number, 0 or greater).
Sets the social factor (number, 0 or greater).
Returns the social factor (number, 0 or greater).
Sets the maximum speed for a particle in the given dimension.
Returns the maximum speed for a particle in the given dimension.
Sets the maximum speed for all dimensions.
Sets the probability of a particle being replaced by another, randomly generated, one. This feature tries to avoid local optima by the simulation of the death and replacement of a particle. The probability must be a number between 0 and 1. The best particle in the swarm is never replaced.
Gets the probability of a particle being replaced by another.
Sets the number of particles.
Returns the number of particles.
Sets the fitness function. The particle position will be passed as an argument for each dimension. The fitness function must return the fitness of the given particle as a number with higher values for better solutions.
Sets the limits for the given dimension.
Returns the minimum and maximum values for the given dimension.
Sets the limits for all dimensions.
Makes the solver round up the fitness to 'decs' decimal places. The value must be a positive integer or 'nil' to disable this feature.
Returns the number of decimal places used to round up the fitness values, or 'nil' if this feature is not used.
Sets the maximum fitness as a termination criterium. Fitness must be a number or 'nil' to disable its use as termination criterium.
Returns the maximum fitness, or 'nil' if it is not used as termination criteria.
Sets the maximum number of iterations as a termination criterium. This must be a integer greater than zero or 'nil' to disable its use as termination criterium.
Returns the maximum number of iterations, or 'nil' if it is not used as termination criteria.
Sets the maximum number of stagnated iterations as a termination criterium. This must be a integer greater than zero or 'nil' to disable its use as termination criterium.
Returns the maximum number of stagnated iterations, or 'nil' if it is not used as termination criteria.
Sets a function to be called when a new best particle if found. The function will receive the particle position, an per dimension. Passing 'nil' disables this feature.
Sets a function to be called when a particle is replaced. The function will receive the position of the dead particle, an per dimension. Passing 'nil' disables this feature.
Sets a function to be called for each iteration of the optimizer. The function will receive a array of particles as first argument and the number of the current iteration as second argument. Each particle in the particle array is a table with the following fields:
fit the fitness value for the best position (number); x particle's position in the n-dimensional space (array of numbers); b particle's best position (array of numbers); v particle's velocity (array of numbers).
these values may be read, but SHOULD NOT be changed or redefined. Passing 'nil' disables this feature.
Warning: Abuse of this feature may slow the algorithm down!
Runs the algorithm and returns a array with the position of the particle, the fitness, the reason of termination (pso.TERM_CONVERGED, pso.TERM_MAX_ITERATIONS, or pso.TERM_MAX_STAGNATION) and the total of iterations.
There are several samples in the "examples
" directory within the distribution package. Follows a example intended to optimize the function :
local pso = require("pso") math.randomseed(os.time()) -- Seeds the pseudo-random number generator local swarm = pso.new(2) -- Creates a new swarm with 2 dimensions swarm:setLimits(-3.0, 3.0) -- Search space swarm:setParticles(10) -- 10 particles swarm:setC1(1.5) -- Cognitive factor swarm:setC2(2.0) -- Social factor swarm:setMaxSpeed(1.0) -- Maximum speed swarm:setReplacementProb(0.05) -- 5% of the particles die each iteration swarm:setPrecision(6) -- Maximum precision of 6 decimal places swarm:setFitnessRounding(6) -- Rounds up the fitness to 6 places swarm:setMaxFitness(1.0) -- Stops when the maximum fitness is reached swarm:setMaxStagnation(20) -- Stops if stalled for 20 generations swarm:setFitnessFunction(function (x, y) return math.cos(x^2 + y^2) - x^2/5 - y^2/5 end) local ret, fit, reason, iter = swarm:run() print("Done", ret[1], ret[2], fit, reason, iter)
9B49 FCE2 E6B9 D1AD 6101 29AD 4F6D F114 0041 A1FB
)


gr.forth.ics.graph.layout
Interfaces
Layout
LayoutProcess
Locator
Locator.LocationListener
Classes
AbstractLayoutProcess
AbstractLocator
BasicLocator
CompositeLocator
Geom
GPoint
GRect
Locators
Logo
Logo.Drawer
Logo.Shaper
RectBuilder
SingleStepLayoutProcess


Pricing
Quickly build an effective pricing table for your potential customers with this Bootstrap example. It's built with default Bootstrap components and utilities with little customization.
Free
- $0 / mo
- 10 users included
- 2 GB of storage
- Email support
- Help center access
Pro
- $0 / mo
- 10 users included
- 2 GB of storage
- Email support
- Help center access
Enterprise
- $0 / mo
- 10 users included
- 2 GB of storage
- Email support
- Help center access


Captain Gilbert:
Well done. I will reward you for every piece of proof you have brought me. This is a reward given to honor the fighters who have faithfully carried out the will of our lord.
The lord's decree is still valid. There is still more Adena left for rewards. Will you continue your hunt, or will you quit?
Say you will quit
Say you will continue


overview of zodiac cipher web widgets
letter distribution widget
by me
is exploring the letter distribution of the Z340 cipher
cipher explorer
by doranchak
is a very useful paint tool for the Z340
webtoy
by doranchak
interactive Zodiac cipher solver


--- title: Mega Man Collections Coming to Nintendo Switch and More! date: 2017-12-05 00:00:00 Z tags: - mega - man layout: post author: Rajiblaze excerpt_separator: "" description: The blue bomber is back in a new adventure ---
More Mega Man news on the way! During the 30th anniversary live stream, Capcom has announced that Mega Man Legacy Collection 1 & 2 will be released on the Nintendo Switch. Collection 1 includes all of the classic Mega Man games from 1 to 6, while Collection 2 has the remaining games form 7 to 10. Both games were previously released on the PS4, Xbox One, and PC, with Collections 2 released August 2017. Expect the Switch versions to come out spring 2018. Mega Man X fans will also be pleased. Capcom is planning on bringing all eight games of the Mega Man X series to the masses. It will be released on all modern consoles, including the Switch. Expect that to come out around summer 2018. With these announcements, anyone with a PC, PS4, Switch or Xbox One will have access to all of the Mega Man games. A pretty sweet deal, if you ask me.


MATCH FIXTURE
DATE:11-11-2017
TEAM 1
TEAM 2
STADIUM
LOCATION
Manchester
Real Madrid
Old Traven
England


I'm a web developer with experience building apps using Rails, React, and JavaScript
My passion is problem solving... done right while learning & discovering new perspectives.
Looking for opportunities to develop more while creating fast,
functional, and elegant software.
POTATOS FLOAT
Single page web application built on Ruby on Rails, Javascript and React.js; emulating the UX of couchsurfing.com
Features include user-controlled search filtering and host approval for requests.
KICK RETURN
Frontend javascript game built entirely with canvas.
AI defenders track and chase player ansynchrously to player movements with contact recognition.


3555 Farnam Street Omaha, NE 68131
Updated May 2, 2014
To view the Owner's Manual you may use Adobe Acrobat® Reader® software. Click
to download. Updated March 1, 2014


My name is Kela, I'm the one on the right in the picture above. I've been working in kitchens and recently as a sous chef for the last 5 years. I want to learn new skills in programming because not only do I want to possibly follow that career path, I just genuinely love learning and feeling my brain suddenly "click"...so to speak, especially if it's challenging!
Hobbies/things I enjoy:


[gecode-users] Some error - I just cannot find it (Windows)
Guido Tack
tack at gecode.org
Wed May 29 01:28:33 CEST 2013
I tried it on Mac OS and it works, no crash. Perhaps it's a problem in the compiler's support for C++11, it's all still quite experimental it seems. Did you compile Gecode with exactly the same flags and compiler as the example?
Cheers,
Guido
On 29/05/2013, at 9:08 AM, Mailing List Email <mailinglistx at gmail.com> wrote:
> Hi,
>
> No, it's not entirely self contained. It was just a dumbed down cut and paste in order to see if anyone could find some quick glaring errors.
> Anyway, here is a minimal example that produced the bug - the crash, at least as far as I could conveniently reduce it to.
> To reproduce the crash: run Gist to find all solutions (press "A"). Then double-click twice on the solution node (the yellow node).
> The program will crash.
>
>
> On 28 May 2013 22:52, Guido Tack <tack at gecode.org> wrote:
> Hi,
>
> your sample code does not compile, are you sure it's self contained? E.g. XGecodeVector2 initialises m_valid which is not defined (and there seem to be other problems).
>
> Cheers,
> Guido
>
> --
> Guido Tack
> http://www.csse.monash.edu/~guidot/
>
>
>
> On 18/05/2013, at 11:33 AM, Mailing List Email <mailinglistx at gmail.com> wrote:
>
>> Hi all,
>>
>> In my project that I'm working on, I seem to get strange errors, but I cannot seem to be able to figure out why, so I figured perhaps you might give some insight into the problem.
>> I'm attaching a simplified version (but not a minimal example) of the code to where I have tracked down the problem. I don't want to force you to sift through tons of code. I included the most relevant parts only. I can provide the full source (it isn't that big) upon request, though. That is fine.
>>
>> My best guess is that there is some memory corruption - some memory getting freed and is then overwritten somewhere. But it might be something else entirely - like I said, I'm not sure because my results are conflicting.
>> I have the tracked the problem down to being the m_rectangle variable. The culprit seems to be the line
>>
>> r1 = std::move(m_rectangles.v().back());
>>
>> If I remove it, all works fine. I have tried using both a Gecode space allocator and the normal standard allocator - both produce the same thing.
>> Because it's memory corruption or something, the bug appears differently depending on how the code is run - never in a single place (unless run under the same parameters).
>>
>> Am I doing this right? Am I missing something? I just can't see what. I have been trying to wrap my head around this for a long time now, but I can't seem to find anything.
>> I hate to ask you to go through a lot of code, but I'm stuck here, so I'd appreciate a little insight -- any insight.
>>
>> I just hope the mailing list accepts attachments. I would hate to have to provide source inline.
>> <Temp.cpp>_______________________________________________
>> Gecode users mailing list
>> users at gecode.org
>> https://www.gecode.org/mailman/listinfo/gecode-users
>
>
> <NoOverlap.cpp><SquarePacking.cpp>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20130529/23366eda/attachment.html>
More information about the users
mailing list


Contact
Get In Touch With Me!
Skip Straight To My Github Profile
Go Home
View Blog
Contact
Name:
Email:
Message:


File: doc/api/util-api.js
/** * A set of helper methods for use by jsPlumb. * @class jsPlumbUtil * @static */ /** * Returns whether the given object is an Array. * @method isArray * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is an Array, false otherwise. */ /** * Returns whether the given object is a String. * @method isString * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is a String, false otherwise. */ /** * Returns whether the given object is a Boolean. * @method isBoolean * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is a Boolean, false otherwise. */ /** * Returns whether the given object is null. * @method isNull * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is null, false otherwise. */ /** * Returns whether the given object is an Object. * @method isObject * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is an Object, false otherwise. */ /** * Returns whether the given object is a Date. * @method isDate * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is a Date, false otherwise. */ /** * Returns whether the given object is a Function. * @method isFunction * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is a Function, false otherwise. */ /** * Returns whether the given object (an Object or Array) is empty. * @method isEmpty * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is empty, false otherwise. */ /** * Returns whether the given object is a Number. * @method isNumber * @static * @param {Object} obj Object to test * @return {Boolean} True if the object is a Number, false otherwise. */ /** * Merges one object into another, optionally folding individual values into arrays. * @method merge * @static * @param {Object} a Object to merge into * @param {Object} b Object to merge from. * @param [String[]] [collations] Optional list of parameter keys for values that, if present in both 'a' and 'b', should result in an array with values from each (rather than the default behaviour of overwriting a's value with b's) */ /** * Provides event bind/fire functionality. * @class jsPlumbUtil.EventGenerator */ /** * Binds a listener to one or more events. * @method bind * @param {String|String[]} event Name(s) of the event(s) to bind to. Note that if you provide multiple event names they all are bound with the same function. * @param {Function} listener Function to execute. * @param {Boolean} [insertAtStart=false] Whether or not to insert this listener at the start of the listener list, so it is fired before the other currently registered listeners. */ /** * Fires an update for the given event. * @method fire * @private * @param {String} event Event to fire * @param {Object} value Value to pass to the event listener(s). * @param {Event} originalEvent The original event from the browser */ /** * Clears either all listeners, or listeners for some specific event, or just some listener. You can call this method * with zero, one or two arguments: with zero arguments, all listeners are cleared. With one argument that is a string, all listeners for * the specified event type are cleared. With one argument that is a function, it is removed from the appropriate event list. * With two arguments, the first is an event type, and the second is a function to be unbound. In fact this is perhaps unnecessary * given that you can unbind a function just by passing it. * @method unbind * @param {String|Function} [eventOrListener] If a string, constrains the clear to just listeners for the event identified by the string. If a Function, unbinds this function wherever it may have been bound. * @param {Function} [listener] If provided, removes just this listener for the given event. */ /** * Sets whether or not events are suspended. * @method setSuspendEvents * @param {Boolean} val Whether or not to suspend events. */ /** * Checks whether or not events are currently suspended. * @method isSuspendEvents * @return {Boolean} True if events are suspended, false otherwise. */ /** * Removes all listeners. * @method cleanupListeners */ /** * Replaces values inside some JS object according to a given path spec. A path spec is a string in dotted notation, * with each component optionally declaring an array index. Some examples are: * * foo.bar * foo.baz[2] * foo.qux[3].baz[3].shwee * * The function fails gracefully if the path identifies a non-existent object. * * @method jsPlumbUtil.replace * @param {Object} inObj Object to perform replacements inside. * @param {String} path Path to use for replacements * @param {Object} value Value to set. */


The most important news you should be aware of.
Some of the information below may be confidential and is subject to change.


home
Dijkstra
Dijkstra
A*(NA)
Dijkstra's shortest path algorithm has a time complexity of
O(|E| + |V|
2
) = O(|V|
2
)
when using arrays or lists and
|E|
is the amount of edges and
|V|
is the amount of vertices.
Data size
Delay (ms)
Sort me!


--- layout: archive title: Zulip Chat Archive permalink: /stream/144837-PR-reviews/topic/.23406.20det.20is.20a.20monoid_hom.html ---
I just created a new PR that proves that det
is a monoid_hom. I suggest closing #375.
Last updated: Apr 24 2020 at 19:02 UTC


Flight 46:
Reused the first-stage booster from the second Iridium NEXT mission. Recovery of the booster was not attempted; an ocean landing was performed. The launch occurred during sunset, which caused a twilight effect where sunlight reflected from the rocket plumes at high altitude. This caused "jaw-dropping views" across Southern California and surrounding regions as the Falcon 9 launched into orbit. -wiki


In this papers, we propose a novel attentional model for simultaneous object tracking and recognition that is driven by gaze data. Motivated by theories of the human perceptual system, the model consists of two interacting pathways: ventral and dorsal. The ventral pathway models object appearance and classification using deep (factored)-restricted Boltzmann machines. At each point in time, the observations consist of retinal images, with decaying resolution toward the periphery of the gaze. The dorsal pathway models the location, orientation, scale and speed of the attended object. The posterior distribution of these states is estimated with particle filtering. Deeper in the dorsal pathway, we encounter an attentional mechanism that learns to control gazes so as to minimize tracking uncertainty. The approach is modular (with each module easily replaceable with more sophisticated algorithms), straightforward to implement, practically efficient, and works well in simple video sequences.


Most Easily Reached?
This question runs the following analytics to rank nodes in order of importance:
Katz Centrality


Geometric primitives.
To get started, use the following geometric primitives for points and
axis-aligned rectangles in the plane.
algs4.jar
) represents points in the plane.
Here is the subset of its API that you may use:
public class Point2D implements Comparable<Point2D> { public Point2D(double x, double y) // construct the point (x, y) public double x() // x-coordinate public double y() // y-coordinate public double distanceTo(Point2D that) // Euclidean distance between two points public double distanceSquaredTo(Point2D that) // square of Euclidean distance between two points public int compareTo(Point2D that) // for use in an ordered symbol table public boolean equals(Object that) // does this point equal that object? public void draw() // draw to standard draw public String toString() // string representation }
algs4.jar
)
represents axis-aligned rectangles.
Here is the subset of its API that you may use:
public class RectHV { public RectHV(double xmin, double ymin, // construct the rectangle [xmin, xmax] x [ymin, ymax] double xmax, double ymax) // throw an IllegalArgumentException if (xmin > xmax) or (ymin > ymax) public double xmin() // minimum x-coordinate of rectangle public double ymin() // minimum y-coordinate of rectangle public double xmax() // maximum x-coordinate of rectangle public double ymax() // maximum y-coordinate of rectangle public boolean contains(Point2D p) // does this rectangle contain the point p (either inside or on boundary)? public boolean intersects(RectHV that) // does this rectangle intersect that rectangle (at one or more points)? public double distanceTo(Point2D p) // Euclidean distance from point p to closest point in rectangle public double distanceSquaredTo(Point2D p) // square of Euclidean distance from point p to closest point in rectangle public boolean equals(Object that) // does this rectangle equal that object? public void draw() // draw to standard draw public String toString() // string representation }
Brute-force implementation.
Write a mutable data type PointSET.java
that represents a set of
points in the unit square.
Implement the following API by using a red–black BST:
public class PointSET { public PointSET() // construct an empty set of points public boolean isEmpty() // is the set empty? public int size() // number of points in the set public void insert(Point2D p) // add the point to the set (if it is not already in the set) public boolean contains(Point2D p) // does the set contain point p? public void draw() // draw all points to standard draw public Iterable<Point2D> range(RectHV rect) // all points that are inside the rectangle (or on the boundary) public Point2D nearest(Point2D p) // a nearest neighbor in the set to point p; null if the set is empty public static void main(String[] args) // unit testing of the methods (optional) }
Implementation requirements.
You must use either
SET
or
java.util.TreeSet
;
do not implement your own red–black BST.
Corner cases.
Throw an IllegalArgumentException
if any argument is null.
Performance requirements.
Your implementation should support insert()
and contains()
in time
proportional to the logarithm of the number of points in the set in the worst case; it should support
nearest()
and range()
in time proportional to the number of points in the set.
2d-tree implementation.
Write a mutable data type KdTree.java
that uses a 2d-tree to
implement the same API (but replace PointSET
with KdTree
).
A 2d-tree is a generalization of a BST to two-dimensional keys.
The idea is to build a BST with points in the nodes,
using the x- and y-coordinates of the points
as keys in strictly alternating sequence.
insert (0.7, 0.2) insert (0.5, 0.4) insert (0.2, 0.3) insert (0.4, 0.7) insert (0.9, 0.6)
draw()
method should draw all of the points to standard draw
in black and the subdivisions in red (for vertical splits) and blue (for
horizontal splits).
This method need not be efficient—it is primarily for debugging.
The prime advantage of a 2d-tree over a BST is that it supports efficient implementation of range search and nearest-neighbor search. Each node corresponds to an axis-aligned rectangle in the unit square, which encloses all of the points in its subtree. The root corresponds to the unit square; the left and right children of the root corresponds to the two rectangles split by the x-coordinate of the point at the root; and so forth.
Clients. You may use the following interactive client programs to test and debug your code.
Analysis of running time and memory usage (optional and not graded).
Web submission.
Submit a .zip file containing only
PointSET.java
and KdTree.java
.
We will supply algs4.jar
.
Your may not call library functions except those in
those in java.lang
, java.util
, and algs4.jar
.


|
|||||||||
| PREV NEXT | FRAMES NO FRAMES |
data
from base64.
data
.
s
and converts the result to a java.math.BigInteger
.
i
to a byte array and base64 encodes the result.
Peer
to find the url of the certificate associated with a local id.CertificatePublisher
that uses a database to map certificate URLs to local ids.dblink
.
PrivateKeyService
that uses a database to locate private keys for local ids.SessionTable
backed by a database.data
with the private key
associated with local_id
.
group
.
header
.
local_id
, or null if not known.
local_id
.
group
.
java.security.MessageDigest
instance.
javax.crypto.Mac
instance to do Hmac.
javax.crypto.Mac
instance for Hmac, initialized with a secret key.
request
.
PrivateKeyService
used by this peer.
header
.
local_id
and owner of url
.
requestContinue
.
SessionTable
used by this peer.
Cipher
object for ciphering a message body.
data
as a string of zero-padded hex couplets.
s
.
s
.
type
.
HttpsecPrincipal
from name
.
HttpsecPrincipal
with id
and fingerprint
.
HttpsecPrincipal
with id
and a fingerprint of key
.
HttpsecURLConnection
.
HttpsecURLConnection
s.HttpsecURLConnectionFactory
.
HttpsecURLConnectionFactory
.
HttpsecURLConnectionFactory
with a default local-id, a private key for decryption.
SessionTable
using a java.util.Map
as the backing store.Client
and Server
.limit
bytes from a stream.
length
bytes of random flavoured algorithm food.
session_data
.
Accept-Encoding: x-httpsec/1.0-cipher
?
bufferSize
we use a file.
interval
> 0 start a thread that will call cleanup
every interval
milliseconds.
PrivateKeyService
used by this peer.
SessionTable
used by this peer.
data
with the private key
associated with local_id
.
new SimpleDateFormat( "EEE, dd MMM yyyy HH:mm:ss zzz" )
.
java.net.HttpURLConnection
.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES |


{{content-for "head"}} {{content-for "head-footer"}}
Hi there. This is where you would usually find your storage dashboard.
Unfortunately, it looks like JavaScript is turned off in your browser, at least for this site. Please note that remoteStorage apps are usually written in JavaScript, so you will have to enable it for the vast majority of compatible Web apps.
This front-end is published under an MIT license and you can find the source code (as well as release builds) at https://github.com/5apps/storage-frontend. We appreciate any and all feedback via GitHub issues, and we will also merge pull requests if we think they improve security or usability.


libsocket is a library written in C for the purpose of simplifying the usage of AF_INET/AF_INET6
(internet domain) and AF_UNIX
(unix domain) sockets. With many specialized functions in the API, it's hard to do things really wrong. And with the excellent error processing with optional verbosity on stderr
, it's also quite easy to debug your applications.
libsocket is targeted at advanced/experienced/professional C-on-Linux programmers which don't like the traditional BSD sockets API. libsocket is not targeted at programmers which do their first experiences with C or sockets! To understand the library, you must have experience with the underlying syscalls.
libsocket is the name for the whole project. libinetsocket is the part for INET
sockets, libunixsocket for UNIX
sockets.
Sometimes, there are expressions in the text looking like this:
getaddrinfo(3)
socket(2)
This are "links" to manpages. They can be reached by the following commands:
$ man 3 getaddrinfo
$ man 2 socket
If you want to see some examples of the usage of this library, take a look at the example programs in examples/. They compile fine on most modern Linux systems and should work out of the box. Explanations are included in the source files.
Note: The manpage extracts come from the manpages delivered with Debian (Linux manpages), usually created by the man-pages project, while the OpenBSD manpage extracts come from http://www.openbsd.org/cgi-bin/man.cgi
If the macro LIBSOCKET_VERBOSE
is defined, libsocket prints verbose error messages on STDERR device. The error messages come from functions like strerror
or gai_strerror
. This is VERY useful when there are problems in your program or the library itself. Typically, you specify it in the Makefile (the variable already exists):
...
CCFLAGS=-DLIBSOCKET_VERBOSE
...
Usually, you'll use this option during development, but disable it when you finished the application. If you use the shared library, specify -DVERBOSE
in the make variable CFLAGS
in C/Makefile
.
Another compile-time option is _TRADITIONAL_RDNS
. It's also a macro (like LIBSOCKET_VERBOSE
) and specifies if the library should use getnameinfo()
or gethostbyaddr()
for rDNS queries. The latter possibility may be sensible e.g. on FreeBSD systems or on other systems were getnameinfo is not an option.
The usage of the flags for some functions is described for every function. If you don't need any flags (you think), you may specify 0
for every flag argument without errors.
If you don't enable the LIBSOCKET_VERBOSE
macro, the library knows another way to notify you if there was an error: The return value. If anything went wrong, the return value is always -1
. Every function behaves this way, so it's
strongly recommended to check the return values of the API functions. To obtain more information about what went wrong, check errno
; the man pages of the used syscalls (described in this document) contain information
about possible errno
values.
As the name says, libinetsocket is the part for internet domain sockets. All important features are supported and it's possible to give flags to the underlying calls, e.g. it's possible to give the flag MSG_DONTROUTE
to the wrapper function of sendto()
.
libinetsocket is adapted for multi-platform usage. It's mainly tested on Linux and FreeBSD, but the goal is also to get it working on OpenBSD which is quite difficult (not as difficult as libunixsocket :-( ...)
libunixsocket is responsible for UNIX domain sockets. The calls are similar to the libinetsocket calls.
libunixsocket is very linux-specific; you can't see multi-platform adaptations etc., and it probably won't run on other platforms.
Build and install the library following the instructions in README.md
and link your application against it using the documentation in LINKAGE
.
Static linking is not recommended. That means, copy a checkout of the library files (C/, headers/) to the source tree of your application. Then, simply compile the files together with the other files (as they would be normal part of your application).
Details about dependancies: The actual code is in libinetsocket.c
resp. libunixsocket.c
. Every file of your application which wants to use this functions has to include the header files, e.g.:
# include "../headers/libinetsocket.c"
# include <stdio.h>
...
.
.
.
Then, compile it (paths are only examples):
$ gcc -c src/*.c
$ gcc -c libsocket/*.c
$ gcc *.o
or...
$ gcc src/*.c libsocket/*.c
The 2-clause BSD license allows this, also for proprietary applications.
create_inet_stream_socket()
int create_inet_stream_socket(const char* host, const char* service, char proto_osi3, int flags)
This function creates, connects and returns a inet stream socket (TCP socket) which is connected to host
:service
.
host
: Destination hostservice
: Destination host's portproto_osi3
: OSI layer 3 protocol: either IPv4
or IPv6
(defined in libinetsocket.h
).flags
is only sensible on Linux >= 2.6.27 - elsewise, specify 0 to avoid errors. Take a look at socket(2)
or the man page extract below.Returns on success the socket file descriptor number, on error -1.
socket(2)
says the following about flags
:
Since Linux 2.6.27, the type argument serves a second purpose: in addition to specifying a socket type, it may include the bitwise OR of any of the following values, to modify the behavior of socket():
SOCK_NONBLOCK
Set theO_NONBLOCK
file status flag on the new open file description. Using this flag saves extra calls to fcntl(2) to achieve the same result.
SOCK_CLOEXEC
Set the close-on-exec (FD_CLOEXEC
) flag on the new file descriptor. See the description of theO_CLOEXEC
flag in open(2) for reasons why this may be useful.
SOCK_NONBLOCK
does not let you wait when read()ing or write()ing; instead of blocking (if there's nothing available) read()/write()
return -1.
SOCK_CLOEXEC
closes the socket if you call a syscall from the exec()
family (to execute another program).
The used protocol is TCP.
To send and receive data from this socket, please use read(2)
and write(2)
.
create_inet_dgram_socket()
int create_inet_dgram_socket(char proto_osi3, int flags)
Returns an integer describing a DGRAM (UDP) socket.
proto_osi3
is LIBSOCKET_IPv4
(AF_INET
) or LIBSOCKET_IPv6
(AF_INET6
).flags
may be the flags specified in socket(2)
, i.e. SOCK_NONBLOCK
and/or SOCK_CLOEXEC
. More than one flags may be ORed. This argument is only sensible on Linux >= 2.6.27!Like the function before, this function also has different prototypes on different platforms.
Returns the socket file descriptor number, on error -1.
The protocol used for communication is UDP.
To send and receive data with this socket, please use the functions explained below, sendto_inet_dgram_socket()
and recvfrom_inet_dgram_socket()
. Of course, it's also possible to use sendto(2)
and recvfrom(2)
, but if you want use them, why do you use libsocket?
sendto_inet_dgram_socket()
ssize_t sendto_inet_dgram_socket(int sfd,void* buf, size_t size,char* host, char* service, int sendto_flags)
This function is the equivalent to sendto()
. It returns the number of bytes which was sent; usually, it's the value
of size
.
sfd
is the Socket File Descriptor (every socket file descriptor argument in libsocket is called sfd
) which
you got from create_inet_dgram_socket()
. The usage with STREAM sockets is not recommended and the result is undefined!buf
is a pointer to some data.size
is the length of the buffer to which buf points.host
is the host to which we want to send the data. It's a string so you may specify everything what's resolved by
getaddrinfo()
, i.e. an IP ("<IP_ADDRESS>") or a hostname ("example.net").service
is the port on the remote host. Like in host
, you may specify the port either as number ("123") or as service string ("ntp", "http", "gopher").sendto_flags
is available on all platforms. The value given here goes directly to the internal sendto()
call. The flags which may be specified differ between the platforms.Returns the number of bytes sent, on error -1.
On Linux, you can get them from the manpage sendto(2)
:
"The flags argument is the bitwise OR of zero or more of the following flags.
MSG_CONFIRM (Since Linux 2.3.15)
Tell the link layer that forward progress happened: you got a successful reply from the other side. If the link layer
doesn't get this it will regularly reprobe the neighbor (e.g., via a unicast ARP). Only valid on SOCK_DGRAM and SOCK_RAW
sockets and currently only implemented for IPv4 and IPv6. See arp(7) for details.
MSG_DONTROUTE
Don't use a gateway to send out the packet, only send to hosts on directly connected networks. This is usually used only by
diagnostic or routing programs. This is only defined for protocol families that route; packet sockets don't.
MSG_DONTWAIT (since Linux 2.2)
Enables nonblocking operation; if the operation would block, EAGAIN or EWOULDBLOCK is returned (this can also be enabled
using the O_NONBLOCK flag with the F_SETFL fcntl(2)).
MSG_EOR (since Linux 2.2)
Terminates a record (when this notion is supported, as for sockets of type SOCK_SEQPACKET).
MSG_MORE (Since Linux 2.4.4)
The caller has more data to send. This flag is used with TCP sockets to obtain the same effect as the TCP_CORK socket option
(see tcp(7)), with the difference that this flag can be set on a per-call basis.
Since Linux 2.6, this flag is also supported for UDP sockets, and informs the kernel to package all of the data sent in calls
with this flag set into a single datagram which is only transmitted when a call is performed that does not specify this flag.
(See also the UDP_CORK socket option described in udp(7).)
MSG_NOSIGNAL (since Linux 2.2)
Requests not to send SIGPIPE on errors on stream oriented sockets when the other end breaks the connection. The EPIPE error
is still returned.
MSG_OOB
Sends out-of-band data on sockets that support this notion (e.g., of type SOCK_STREAM); the underlying protocol must also
support out-of-band data."
On OpenBSD, sendto(2)
says this:
The flags parameter may include one or more of the following:
MSG_OOB process out-of-band data
MSG_DONTROUTE bypass routing, use direct interface
MSG_NOSIGNAL don't send SIGPIPE
FreeBSD has this flags available (sendto(2)
):
The flags argument may include one or more of the following:
#define MSG_OOB 0x00001 /* process out-of-band data */
#define MSG_DONTROUTE 0x00004 /* bypass routing, use direct interface */
#define MSG_EOR 0x00008 /* data completes record */
#define MSG_EOF 0x00100 /* data completes transaction */
#define MSG_NOSIGNAL 0x20000 /* do not generate SIGPIPE on EOF */
If it is not possible to send data at the moment, this call blocks excepted you specified SOCK_NONBLOCK
when creating the socket.
recvfrom_inet_dgram_socket()
ssize_t recvfrom_inet_dgram_socket(int sfd, void* buffer, size_t size, char* src_host, size_t src_host_len, char* src_service, size_t src_service_len, int recvfrom_flags, int numeric)
recvfrom_inet_dgram_socket()
is the equivalent to recvfrom()
.
sfd
- socket file descriptorbuffer
: Memory area to which the received data is writtensize
: Size (in bytes) of the buffersrc_host
: Buffer to which the source host is written. May be 0, then the source is discardedsrc_host_len
: Length of the src_host
buffersrc_service
: Buffer to which the source port is written. May be 0, then the source port is discarded.src_service_len
: Length of src_service
bufferrecvfrom_flags
is a ORed combination of the flags below (Linux)numeric
: May be LIBSOCKET_NUMERIC
(defined in header files, then source port and host are given back numeric.Returns the number of bytes received, or -1 if an error occurred.
MSG_CMSG_CLOEXEC (recvmsg() only; since Linux 2.6.23)
Set the close-on-exec flag for the file descriptor received via a UNIX domain file descriptor using the SCM_RIGHTS operation
(described in unix(7)). This flag is useful for the same reasons as the O_CLOEXEC flag of open(2).
MSG_DONTWAIT (since Linux 2.2)
Enables nonblocking operation; if the operation would block, the call fails with the error EAGAIN or EWOULDBLOCK (this can
also be enabled using the O_NONBLOCK flag with the F_SETFL fcntl(2)).
MSG_ERRQUEUE (since Linux 2.2)
This flag specifies that queued errors should be received from the socket error queue. The error is passed in an ancillary
message with a type dependent on the protocol (for IPv4 IP_RECVERR). The user should supply a buffer of sufficient size.
See cmsg(3) and ip(7) for more information. The payload of the original packet that caused the error is passed as normal
data via msg_iovec. The original destination address of the datagram that caused the error is supplied via msg_name.
For local errors, no address is passed (this can be checked with the cmsg_len member of the cmsghdr). For error receives,
the MSG_ERRQUEUE is set in the msghdr. After an error has been passed, the pending socket error is regenerated based on the
next queued error and will be passed on the next socket operation.
The error is supplied in a sock_extended_err structure:
#define SO_EE_ORIGIN_NONE 0
#define SO_EE_ORIGIN_LOCAL 1
#define SO_EE_ORIGIN_ICMP 2
#define SO_EE_ORIGIN_ICMP6 3
struct sock_extended_err
{
uint32_t ee_errno; /* error number */
uint8_t ee_origin; /* where the error originated */
uint8_t ee_type; /* type */
uint8_t ee_code; /* code */
uint8_t ee_pad; /* padding */
uint32_t ee_info; /* additional information */
uint32_t ee_data; /* other data */
/* More data may follow */
};
struct sockaddr *SO_EE_OFFENDER(struct sock_extended_err *);
ee_errno contains the errno number of the queued error. ee_origin is the origin code of where the error originated. The
other fields are protocol-specific. The macro SOCK_EE_OFFENDER returns a pointer to the address of the network object where
the error originated from given a pointer to the ancillary message. If this address is not known, the sa_family member of
the sockaddr contains AF_UNSPEC and the other fields of the sockaddr are undefined. The payload of the packet that caused
the error is passed as normal data.
For local errors, no address is passed (this can be checked with the cmsg_len member of the cmsghdr). For error receives,
the MSG_ERRQUEUE is set in the msghdr. After an error has been passed, the pending socket error is regenerated based on the
next queued error and will be passed on the next socket operation.
MSG_OOB
This flag requests receipt of out-of-band data that would not be received in the normal data stream. Some protocols place
expedited data at the head of the normal data queue, and thus this flag cannot be used with such protocols.
MSG_PEEK
This flag causes the receive operation to return data from the beginning of the receive queue without removing that data from
the queue. Thus, a subsequent receive call will return the same data.
MSG_TRUNC (since Linux 2.2)
For raw (AF_PACKET), Internet datagram (since Linux 2.4.27/2.6.8), and netlink (since Linux 2.6.22) sockets: return the real
length of the packet or datagram, even when it was longer than the passed buffer. Not implemented for UNIX domain (unix(7))
sockets.
For use with Internet stream sockets, see tcp(7).
MSG_WAITALL (since Linux 2.2)
This flag requests that the operation block until the full request is satisfied. However, the call may still return less
data than requested if a signal is caught, an error or disconnect occurs, or the next data to be received is of a different
type than that returned.
OpenBSD's recvfrom(2)
says this about recvfrom()'s flags:
MSG_OOB process out-of-band data
MSG_PEEK peek at incoming message
MSG_WAITALL wait for full request or error
MSG_DONTWAIT don't block
And last, but not least FreeBSD:
The flags argument to a recv() function is formed by or'ing
one or more of the values:
MSG_OOB process out-of-band data
MSG_PEEK peek at incoming message
MSG_WAITALL wait for full request or error
MSG_DONTWAIT do not block
connect_inet_dgram_socket()
int connect_inet_dgram_socket(int sfd, char* host, char* service)
Calling connect(2)
on DGRAM sockets is possible - you do it with this function.
If you do it, subsequent calls to read(2)
and write(2)
will receive and send data only to the host and service you connected to. Sending/receiving to/from other hosts
is still possible with {recvfrom,sendto}_inet_dgram_socket()
. You may see an example covering this as explained here in
examples/echo_dgram_connected_client.c
.
sfd
is the file descriptorhost
and service
are the target address parameters, like in create_inet_stream_socket()
.You may call this function multiple times on one socket to reconnect it.
You may 'de-connect' a socket by calling
connect_inet_dgram_socket(socket,0,0);
where the second 0 also could be "abc" - important is that the host argument is 0. After this call, the connection
is solved and write(2)/read(2)
is not possible anymore. Of course, you may call this function again to connect the socket.
Returns 0 on success, -1 on error.
destroy_inet_socket()
int destroy_inet_socket(int sfd)
Simply calls close(2)
on sfd
.
Returns 0 on success, -1 on error.
shutdown_inet_stream_socket()
int shutdown_inet_stream_socket(int sfd, int method)
Calls shutdown(2)
on sfd
.
sfd
: Socket file descriptormethod
is either LIBSOCKET_READ
, LIBSOCKET_WRITE
or the ORed combination LIBSOCKET_READ|LIBSOCKET_WRITE
.Calling shutdown_inet_stream_socket()
on a socket has the following effects:
method
is LIBSOCKET_READ
: Disallow subsequent calls to read()
method
is LIBSOCKET_WRITE
: Disallow subsequent calls to write()
and send an EOF-like signal to the remote hostmethod
is LIBSOCKET_READ|LIBSOCKET_WRITE
: Combination of the two actions before.Returns 0 upon success, -1 on error.
create_inet_server_socket()
int create_inet_server_socket(const char* bind_addr, const char* bind_port, char proto_osi4, char proto_osi3, int flags)
Creates a server socket, also known as Passive Socket. With this socket, you may accept connections (STREAM) or simply bind a UDP socket - if you use it as UDP "server" socket, it's almost the same like a socket created with create_inet_dgram_socket()
, but it's bound (bind(2)
) to a fix address.
The arguments:
bind_addr
: The address to which the socket is bound to. E.g.: "<IP_ADDRESS>" for localhost, "<IP_ADDRESS>" for all available addressesbind_port
: The port to bind to.proto_osi4
: LIBSOCKET_UDP
or LIBSOCKET_TCP
(defined in headers)proto_osi3
: LIBSOCKET_IPv4
or LIBSOCKET_IPv6
.flags
: SOCK_NONBLOCK
or SOCK_CLOEXEC
(like in create_inet_stream_socket()
etc, on non-linux systems, specify it as 0)Internals: The backlog
argument of listen(2)
when using TCP sockets is set to LIBSOCKET_BACKLOG
, defined at the beginning of src/libinetsocket.c. Default is 128, the maximum value on Linux. This may differ on other platforms.
Returns a valid socket file descriptor on success, on error, -1 is returned.
accept_inet_stream_socket()
int accept_inet_stream_socket(int sfd, char* src_host, size_t src_host_len, char* src_service, size_t src_service_len, int flags, int accept_flags)
Accept incoming connections on server sockets created with create_inet_server_socket()
(above).
sfd
: Socketsrc_host
: Buffer to which the source host is writtensrc_host_len
: Length of the previous buffersrc_service
: Buffer to which the source port is writtensrc_service_len
: Length of the previous bufferflags
: may be LIBSOCKET_NUMERIC
.accept_flags
are passed to accept4()
.This function will block until there's an incoming connection.
Returns a stream file descriptor connected to the connecting client. On error, -1 is returned.
get_address_family()
int get_address_family(const char* host)
Returns the libsocket address family for the given host
. The address family is either
LIBSOCKET_IPv4
or LIBSOCKET_IPv6
(defined in libinetsocket header file).
This function is very useful when creating a UDP socket for a certain destination (host
); without this function
it would be impossible to obtain the address family to use for such a socket (UDP sockets do not have the BOTH
address family available)
Thanks also to github user andreas-erbsen.
As mentioned in the introduction, libunixsocket is Linux-specific. Until now, it did not run on other Unixes than Linux.
create_unix_stream_socket()
int create_unix_stream_socket(const char* path, int flags)
Creates a UNIX STREAM socket and connects it to path
.
path
: The socket is connected to the path given with this argument.flags
: Optional flags for socket(2)
: SOCK_CLOEXEC
and SOCK_NONBLOCK
Returns a valid socket descriptor on success or -1 on error.
create_unix_dgram_socket()
int create_unix_dgram_socket(const char* bind_path, int flags)
Creates a UNIX DGRAM socket and binds it optionally to bind_path
.
bind_path
: If this is not 0, the socket is bound to this path, i.e. a socket file is created with this name.flags
: Optional flags for socket(2)
: SOCK_CLOEXEC
and SOCK_NONBLOCK
Returns a valid socket descriptor on success or -1 on error.
connect_unix_dgram_socket()
int connect_unix_dgram_socket(int sfd, const char* path)
Connect a UNIX DGRAM socket.
sfd
: The socketpath
: The path of the socket to which we want to connect the socket.Returns 0 on success and -1 on error.
destroy_unix_socket()
int destroy_unix_socket(int sfd)
Destroy (close) a socket.
sfd
: The socket file descriptor.Returns 0 on success and -1 on error.
shutdown_unix_stream_socket()
int shutdown_unix_stream_socket(int sfd, int method)
sfd
: Socket file descriptormethod
: LIBSOCKET_READ
/LIBSOCKET_WRITE
/LIBSOCKET_READ|LIBSOCKET_WRITE
Calling shutdown_inet_stream_socket()
on a socket has the following effects:
method
is LIBSOCKET_READ
: Disallow subsequent calls to read()
method
is LIBSOCKET_WRITE
: Disallow subsequent calls to write()
and send an EOF-like signal to the remote hostmethod
is LIBSOCKET_READ|LIBSOCKET_WRITE
: Combination of the two actions before.Returns 0 upon success, -1 on error.
create_unix_server_socket()
int create_unix_server_socket(const char* path, int socktype, int flags)
Creates a new UNIX server (passive) socket.
path
: Path to which the new socket is bound to.socktype
: LIBSOCKET_STREAM
or LIBSOCKET_DGRAM
(symbolic constants from header files)flags
: Flags for socket(2)
: SOCK_NONBLOCK
or SOCK_CLOEXEC
Returns a valid passive socket descriptor or -1 on error.
Note: If you specify DGRAM
as socktype, you get the same result like with create_unix_dgram_socket("path",0)
because there's
no difference between server and client when using DGRAM sockets (of course, you have to bind server sockets)
accept_unix_stream_socket()
int accept_unix_stream_socket(int sfd, int flags)
Accepts a connection on UNIX stream sockets.
sfd
is the passive socket, generated by create_unix_server_socket()
.flags
is a combination of SOCK_CLOEXEC
and/or SOCK_NONBLOCK
for the new (client) socket.Returns a socket connected to the client, or -1 on error.
recvfrom_unix_dgram_socket()
ssize_t recvfrom_unix_dgram_socket(int sfd, void* buf, size_t size, char* from, size_t from_size, int recvfrom_flags)
Receives a datagram which is sent to the socket sfd
which should be bound to somewhere.
sfd
is the socketbuf
is a buffer to which the data is writtensize
is its sizefrom
is a buffer to which the source address is writtenfrom_size
is its sizerecvfrom_flags
is a combination of flags for recvfrom()
(see section recvfrom_inet_dgram_socket()
)Returns the number of received bytes, or -1 on error.
sendto_unix_dgram_socket()
ssize_t sendto_unix_dgram_socket(int sfd, void* buf, size_t size, const char* path, int sendto_flags)
Sends a message to another socket.
sfd
: Socketbuf
: Buffersize
: Its lengthpath
: The path of the other socketsendto_flags
: Combination of flags, as described at sendto_inet_dgram_socket()
.Returns number of sent bytes or -1.


The Experimental tab
These preferences enable features that are considered experimental,
inserted to garner user feedback.
- Graphics acceleration: One Logisim user observed
that adding -Dsun.java2d.d3d=True to the command line seemed
to improve Logisim's graphics performance by telling it to use hardware graphics
acceleration. This drop-down box attempts to
configure Logisim to set this up; reports about whether this drop-down box has
any effect on performance would be welcome. It won't have
any effect until Logisim is restarted.
Next: Command line options.


The NYC HTML5 meetup group is one of our favorites to attend, so we’re super-excited that Gilt Lead Software Engineer Eric Shepherd is one of the featured speakers for April! Eric’s talk, “Matrix of Detection,” goes a li’ something like this:
Imagine a three-dimensional space created by X, Y, and Z axes. On the X axis, device detection determines the right quantity of code for the device; on the Y axis, resolution detection responds to the user’s screen size; and on the Z axis, feature detection further tailors the experience to the browser’s capabilities. With users located at points within this three-dimensional matrix, a single application can be served to everyone.
The night’s other featured speakers include Leonard Bogdonoff and Deni Spasovski. The meetup takes place Wednesday, April 16 at Conde Nast’s headquarters. There’s currently a wait list, but a spot might become available so sign up and see what happens!


--- layout: page title: Get Simpol Jekyll Theme description: More information about Simpol Theme, a content writer's best friend. Setup a Jekyll blog and start writing, fast! ---
$ git clone git@github.com:username/reponame.git
$ gem install bundler
$ bundle install
$ bundle exec jekyll serve
Simply run $ gem install simpol-jekyll-theme
to download the latest Gem
See the gem details and learn more at rubygems.org
Or:
$ gem install bundler
$ bundle install
$ bundle exec jekyll serve


{extend name="app/shop/view/base.html" /} {block name="resources"} {/block} {block name="body"} {if $type == 1}


Previous: Order accessor, Up: Ordering methods [Contents][Index]
On success, returns, the “high rank only” flag of ordering o. See marpa_o_high_rank_only_set().
Return value: On success, the value of the “high rank only” flag, which is a boolean. On hard failure, -2.
Sets the “high rank only” flag of ordering o. A flag of 1 indicates that, when ranking, all choices should be discarded except those of the highest rank. A flag of 0 indicates that no choices should be discarded on the basis of their rank.
A value of 1 is the default.
The value of the “high rank only” flag has no effect
until ranking is turned on using the
marpa_o_rank()
method.
Hards fails if the ordering is frozen.
Return value: On success, a boolean which is the value of the “high rank only” flag after the call. On hard failure, -2.
By default, the ordering of parse trees is arbitrary. On success, the following happens:
Return value: On success, a non-negative value. On hard failure, -2.