February 20, 2015
This is more "e-discovery" than forensics but I recently had a case where I needed to 1,300 files that were in a user's Recycle Bin.
It was not overly important to the user's management when they were originally created or when it was deleted. They just wanted to review the documents. So I took an hour and hammered out this beast.
#Purpose: Copy all of the contents of the Recycle Bin to a destination folder
# perserving the dir structure and filename.
# Not meant as a forensically sound aquistion tool. Just a means to an end.
#This hack job of a python script does:
#1. Looks for $I files
#2. Checks to see if the corresponding $R file exists
#3. Parses $I files to get the original filename and path
#4. Copies the $R file to the output folder recreating the original dir structure
# Example:
# c:\test\subdir\uselessfile.txt gets deleted.
# This script will copy the file out of the Recycle Bin to c:\Temp\Root\Test\subdir\uselessfile.txt.
# If one already exists there, it will keep trying make a unique name ex: uselessfile12345.txt
import os
import random
from os.path import exists
RecBin = 'C: \\ $Recycle.Bin'
DestFolder = 'c: \\ Temp \\ test'
def look4ifiles ( ext , dirname , names ):
for name in names :
if name . lower (). startswith ( '$i' ):
check4rfile ( dirname , name )
def check4rfile ( ifiledirname , ifilename ):
rfilename = ifilename . lower (). replace ( '$i' , '$r' )
if exists ( os . path . join ( ifiledirname , rfilename )):
parseifile ( ifiledirname , ifilename , rfilename )
else :
print ( "Can not find " + rfilename + " for " + os . path . join ( ifiledirname , rfilename ))
def parseifile ( ifiledirname , ifilename , rfilename ):
dest_path = ""
ifile = os . path . join ( ifiledirname , ifilename )
with open ( ifile , "rb" ) as f :
f . seek ( 28 )
file_path = f . read ( 1 )
while file_path != "" :
if int ( file_path . encode ( "hex" ), 16 ) != 0 :
dest_path += file_path
file_path = f . read ( 1 )
extractfromrecbin ( ifiledirname , rfilename , dest_path )
def finduseabledestinationfilepath ( final_dest_path ):
if exists ( final_dest_path ):
fileName , fileExtension = os . path . splitext ( final_dest_path )
trythisone = str ( fileName + str ( random . randint ( 0 , 1000000 )) + fileExtension )
print trythisone
return finduseabledestinationfilepath ( trythisone )
else :
return final_dest_path
def extractfromrecbin ( ifiledirname , rfilename , dest_path ):
rfile = ifiledirname + ' \\ ' + rfilename
outputlocation = finduseabledestinationfilepath ( DestFolder + dest_path )
os . system ( 'echo f |xcopy /Y \" ' + rfile + ' \" \" ' + str ( outputlocation ) + ' \" ' )
#os.path.walk(RecBin, look4ifiles, exten)
for root , dirs , files in os . walk ( "c: \\ $recycle.bin" , topdown = False ):
for name in files :
if name . lower (). startswith ( '$i' ):
check4rfile ( root , name )


We hope you enjoyed the questions!
***
App designed and developed by mARkeT:
Siobhan Browne | Folklore & Ethnology and History
Larkin Cunningham | Digital Humanities (UCC) & Computing (CIT) | @LarkinDC
Pedro Fernandez | Catalan Studies & Digital Humanities | @pfdorado
Jessica Jones | Philosophy and Digital Humanities | @LoJo2013
Isabelle Jouinot | French and Applied Linguistics | @isabellejouinot
Sarah Kelleher | Art History
Nicholas O’Riordan | Irish Film Studies| @nicholasor


Homepage
FAQ
Twitter
Newsletter
Food Trucks
Parking
Member Agreement
Anti-Harrassment Policy
{{ content }}


# The command below will search the file system for file names containing certain keywords. You can specify as many keywords as you wish.
dir /s *pass* == *cred* == *vnc* == *.config*
# Search certain file types for a keyword, this can generate a lot of output.
findstr /si password *.xml | *.ini | *.txt
# Similarly the two commands below can be used to grep the registry for keywords, in this case "password".
reg query HKLM /f password /t REG_SZ /s
reg query HKCU /f password /t REG_SZ /s
# Additional
reg query HKLM /s | findstr /i password > temp.txt
reg query HKCU /s | findstr /i password > temp.txt


.
Hello there, awesome person!
first header
Github
This is a link to GitHub!
Code academy
This is a link to codeacademy
Google
This is a link to google


old world hospitality welcomes you to indian accent at the lodhi. multi award winning chef, manish mehrotra has
created an inventive indian menu that shall hopefully take you on a unique culinary journey.
seasonal and organic (where possible) and fresh local produce join unusual ingredients from world cuisine to create
a menu that we hope will excite the adventurous, yet satisfy traditional tastes and evoke nostalgia. this is our
attempt at proposing indian food for the twenty first century – a unique marriage of global ingredients and
techniques with the flavours and traditions of india.


Issue 59
Welcome to another issue of Haskell Weekly! Haskell is a purely functional programming language that focuses on robustness, concision, and correctness. This is a weekly summary of what’s going on in its community.
Featured
-
With our framework, writing professional Haskell apps and games becomes a reality. In minutes one can have the complete toolchain and see the first app running on a phone or published on the online store. If you weren’t considering using Haskell yet, we hope you soon change your mind.
-
Translating a C++ parser to Haskell
Recently I translated Nix’s derivation parser to Haskell and I thought this would make an instructive example for how C++ idioms map to Haskell idioms. This post targets people who understand Haskell’s basic syntax but perhaps have difficulty translating imperative style to a functional style.
-
What many languages address via patterns, in Haskell we address via language features (like built-in immutability, lambdas, laziness, etc.). However, I believe there is still room for some high-level guidance on structuring programs, which I’ll loosely refer to as a Haskell design pattern.
-
Front Row is hiring a senior backend Haskell engineer (ad)
Come change how 6.5+ million K-12 US students learn Math, Language Arts, Social Studies and more. Use data, advanced type systems, great product design and deep pedagogy to change lives.
-
10 things Idris improved over Haskell
This post describes some of the pleasant surprises you get trying out Idris, coming from the Haskell world. These pleasant surprises have nothing to do with the dependent typing features. They are simple yet impacting modifications, which improve the developer experience substantially.
-
Migrating text metrics to pure Haskell
text-metrics-0.3.0 is written in pure Haskell, almost as fast as the previous versions (especially for not very long inputs), and is more correct (we handle characters represented as two
Word16
values properly). -
This was my first time attending ZuriHac and it was too much fun — will definitely be back next year! Big thanks to Jasper Van der Jeugt, Simon Meier, and all of the HSR folks that made the event happen. Props to the Haskell community too for being friendly and inviting.
-
Haddock markup quick reference
This page is a single-page quick reference for the markup used in GHC’s Haddock documentation format. It doesn’t list all the details of the format, just the basic markup, so for the vagaries and edge-cases of the syntax, it would be helpful to consult the Haddock user guide.
-
The performance tests do two things: first, they make sure that when people change the compiler, they don’t accidentally make it slower; secondly, they make sure that when people change the compiler, they don’t accidentally make the generated code less efficient.
-
One of the remaining problems is that the
package.cabal
file is in a custom format. Custom formats are generally not good because you can’t leverage the existing tools and free-ride other people’s work. -
Haskell taketh away: Limiting side effects for parallel programming
In designing parallel programming abstractions, taking away user capabilities is as important as granting them. In this talk, I’ll explain the role of this idea in several different parallel programming libraries for Haskell, C++, and other languages — spanning from shared memory to big data.
Package of the week
This week’s package of the week is generic-lens, a library that exposes generic data structure operations as lenses.
In brief
- Binary instances for GADTs (or: RTTI in Haskell)
- Data structures are antithetical to functional programming
- Drive-by Haskell contributions
- On friendly contributing policies
- Taking a close look at lenses
- Teaching Haskell for understanding
- The Haskell Cast episode 14: Richard Eisenberg on dependent types


The Phylogenetic Ornstein-Uhlenbeck Mixed Model (POUMM) allows to estimate the phylogenetic heritability of continuous traits, to test hypotheses of neutral evolution versus stabilizing selection, to quantify the strength of stabilizing selection, to estimate measurement error and to make predictions about the evolution of a phenotype and phenotypic variation in a population. The package implements combined maximum likelihood and Bayesian inference of the univariate Phylogenetic Ornstein-Uhlenbeck Mixed Model, fast parallel likelihood calculation, maximum likelihood inference of the genotypic values at the tips, functions for summarizing and plotting traces and posterior samples, functions for simulation of a univariate continuous trait evolution along a phylogenetic tree. For examples on using the package, see the package vignettes.
| Version: | 2.1.2 |
| Depends: | R (≥ 3.1.0), stats, Rcpp, methods |
| Imports: | ape, data.table (≥ 1.10.4), coda, foreach, ggplot2, lamW, adaptMCMC, utils |
| LinkingTo: | Rcpp |
| Suggests: | testthat, Rmpfr, mvtnorm, lmtest, knitr, rmarkdown, parallel, doParallel |
| Published: | 2018-11-15 |
| Author: | Venelin Mitov [aut, cre, cph] |
| Maintainer: | Venelin Mitov <vmitov at gmail.com> |
| BugReports: | https://github.com/venelin/POUMM/issues |
| License: | GPL (≥ 3.0) |
| URL: | https://venelin.github.io/POUMM/index.html, https://github.com/venelin/POUMM |
| NeedsCompilation: | yes |
| Citation: | POUMM citation info |
| Materials: | README |
| CRAN checks: | POUMM results |
| Reference manual: | POUMM.pdf |
| Vignettes: |
Interpreting the POUMM model parameters A User Guide to The POUMM R-package |
| Package source: | POUMM_2.1.2.tar.gz |
| Windows binaries: | r-devel: POUMM_2.1.2.zip, r-release: POUMM_2.1.2.zip, r-oldrel: POUMM_2.1.2.zip |
| OS X binaries: | r-release: POUMM_2.1.2.tgz, r-oldrel: POUMM_2.1.2.tgz |
| Old sources: | POUMM archive |
Please use the canonical form https://CRAN.R-project.org/package=POUMM to link to this page.


The IT Compass Test is inspired by the now famous
Political Compass test, a great source of criticisms and memes. You
will simply have to indicate (freely and according to your ideas) how
much you agree with 20 propositions about the worlds of information
technology, software, networks, internet, social networks, and the
latest technologies. There are not right or wrong answers. At the
end of the test, you will find the result based on your answers and
some guidelines to understand it.
I made this website during my free time as a simple educational project.
The source code is available on my
GitHub profile.
This test is not based on any scientific study and the results do not
strictly represent the reality. Please, do not use this website as a
penetration testing target: you will just waste my time and will not find anything interesting.
{% endblock %}


— Corey Butler (@goldglovecb)
— Brian Moeskau (@bmoeskau)
Thanks to our venue sponsor:
Thanks to our food sponsor:
Last version check — January 2016:
| 48 | 44 | 34 | 10586 | 9.0.1 |
As of February 24, 2016:
| 48 | 44 44.0.2 |
34 35 |
10586 | 9.0.1 |
See our notes about Microsoft Edge Versioning.
CSS Writing Modes Level 3 without "webkit" prefix, along with syntax updates to the most recent CR. As part of the work, a non-standard value "horizontal-bt" is removed from -webkit-writing-mode.
Fixing bugs pays off!
| Reward | Bug Number | Status | Issue | Fixed By |
|---|---|---|---|---|
| $25,633.70 | 583431 | CRITICAL | CVE-2016-1629: Same-origin bypass in Blink and Sandbox escape in Chrome. | Anonymous |
| $7,500.00 | 546677 | High | CVE-2016-1622: Same-origin bypass in Extensions. | Anonymous |
| $7,500.00 | 577105 | High | CVE-2016-1623: Same-origin bypass in DOM. | Mariusz Mlynski |
| $TBD | 583607 | High | CVE-2016-1624: Buffer overflow in Brotli. | lukezli |
| $1,000.00 | 509313 | Medium | CVE-2016-1625: Navigation bypass in Chrome Instant. | Jann Horn |
| $41,633.70 |
/* Use the default settings */
font-feature-settings: normal;
/* Set values for OpenType feature tags */
font-feature-settings: "smcp";
font-feature-settings: "smcp" on;
font-feature-settings: "swsh" 2;
font-feature-settings: "smcp", "swsh" 2;
/* Global values */
font-feature-settings: inherit;
font-feature-settings: initial;
font-feature-settings: unset;
/* use small-cap alternate glyphs */
.smallcaps { font-feature-settings: "smcp" on; }
/* convert both upper and lowercase to small caps (affects punctuation also) */
.allsmallcaps { font-feature-settings: "c2sc", "smcp"; }
/* enable historical forms */
.hist { font-feature-settings: "hist"; }
/* use the second available swash character */
.swash { font-feature-settings: "swsh" 2; }
/* enable stylistic set 7 */
.fancystyle {
font-family: Gabriola; /* available on Windows 7, and on Mac OS */
font-feature-settings: "ss07";
}

plain

plain

smallcaps

smallcaps

Fancy Style

Fancy Style
A consortium of Chinese buyers bid $1.2B to purchase Opera earlier this month. Opera (OPESF $7.71) is receptive to the idea. A buyout would most likely mean Opera would focus more on mobile. Despite this, they're working on a new desktop browser.
/
#


Emilio Estevez
Github
Linked In
Contact Me
About Me
Hello, I am Emilio Estevez and I am a driven, dedicated, and detail oriented Web Developer in Austin, TX. Currently I know some HTML and CSS but I will learn more in the future!


Isle Tourism Center.
If you wish to, please feel free to ask about our giant cat travel packages. Some include a flight on our majestic dragon cat.
Main Page
Accommodations
Activities
Contact Info
Pictures


http://faceup.me/img?overlay={hipster,clown,mustache,scumbag}&src=YOUR_IMAGE_URL
About
Faceup.me is open source software, built by a group of crazy guys. To view the source visit the github repo
Faceup.me is open source software, built by a group of crazy guys. To view the source visit the github repo


Offline
I'm going off line for about three weeks. Off for Christmas with my
girlfriend Emily in New
Hampshire, then a vacation in London. It's my first time to Europe, so
I'm excited. I think I'm looking forward to disconnecting too. See y'all
on the other side of the new year.
Created 19 Dec '03
Modified 14 Dec '04
Take care Ian, London isn't really cheap.
For some reason I had assumed you were English. Just shows, you
should never judge a guy's nationality by his beard.


Speak now.
The other demos here are text-based and work on the iPhone, iPad, Firefox, and Internet Explorer.


Class PathFinderUtility
Inherited Members
Namespace: XRTK.Editor.Utilities
Assembly: XRTK.Editor.dll
Syntax
public static class PathFinderUtility
Properties
| Improve this Doc View SourceXRTK_Core_AbsoluteFolderPath
The absolute folder path to the Mixed Reality Toolkit in your project.
Declaration
public static string XRTK_Core_AbsoluteFolderPath { get; }
Property Value
| Type | Description |
|---|---|
| String |
XRTK_Core_RelativeFolderPath
The relative folder path to the Mixed Reality Toolkit "com.xrtk.core" folder in relation to either the "Assets" or "Packages" folders.
Declaration
public static string XRTK_Core_RelativeFolderPath { get; }
Property Value
| Type | Description |
|---|---|
| String |
XRTK_SDK_AbsoluteFolderPath
The absolute folder path to the Mixed Reality Toolkit's SDK in your project.
Declaration
public static string XRTK_SDK_AbsoluteFolderPath { get; }
Property Value
| Type | Description |
|---|---|
| String |
XRTK_SDK_RelativeFolderPath
The relative folder path to the Mixed Reality Toolkit "com.xrtk.sdk" folder in relation to either the "Assets" or "Packages" folders.
Declaration
public static string XRTK_SDK_RelativeFolderPath { get; }
Property Value
| Type | Description |
|---|---|
| String |
Methods
| Improve this Doc View SourceResolvePath<T>(Type)
Resolves the path to the provided IPathFinder.Type
Declaration
public static string ResolvePath<T>(Type pathFinderType)
where T : IPathFinder
Parameters
| Type | Name | Description |
|---|---|---|
| Type | pathFinderType | The Type of IPathFinder to resolve the path for. |
Returns
| Type | Description |
|---|---|
| String | If found, the relative path to the root folder this IPathFinder references. |
Type Parameters
| Name | Description |
|---|---|
| T | IPathFinder constraint. |


All people who are: residents of Ontario and either a Canadian citizen, permanent resident or protected person, and meet the eligibility requirements below, are eligible to participate in training funded through the Canada-Ontario Job Grant.
Eligibility requirements are as follows:
- Employed individuals must be identified by their employer.
- Unemployed individuals must also be sponsored by an employer, demonstrated through a permanent or conditional offer of employment.
- An individual must not be participating in full-time training or education or any other government training intervention that offers funding support for same tuition, books or other training related costs (e.g., Second Career).


Eurojackpot results for Friday 7th September 2018
The winning numbers for the 36th Eurojackpot draw in 2018 that took place on Friday 7th September at 21:00 CEST (20:00 GMT) were:
Winners
Winners
Amount
Slovenian Prize Breakdown
View prize breakdowns for other countries| Numbers Matched | Prize Per Winner | Winners from Slovenia | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 1 | €522,991.80 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | 0 | €0 | 42 |
|
Match 4 and 1 Euro Number |
€222.90 | 14 | €3,120.60 | 745 |
|
Match 4 |
€83.60 | 20 | €1,672 | 1,545 |
|
Match 3 and 2 Euro Numbers |
€61.20 | 19 | €1,162.80 | 1,809 |
|
Match 2 and 2 Euro Numbers |
€22.80 | 353 | €8,048.40 | 25,008 |
|
Match 3 and 1 Euro Number |
€18.20 | 343 | €6,242.60 | 30,269 |
|
Match 3 |
€12.60 | 838 | €10,558.80 | 62,653 |
|
Match 1 and 2 Euro Numbers |
€10.80 | 1,839 | €19,861.20 | 133,214 |
|
Match 2 and 1 Euro Number |
€8.30 | 5,593 | €46,421.90 | 424,482 |
|
Total |
- | 9,020 | €620,080.10 | 679,780 |
Eurojackpot prizes in Slovenia must be claimed within 90 days of the draw date, so tickets purchased for this draw were valid until Thursday 6th December 2018.
Additional Draw Information
In total there were 18,458,535 entries into this draw from all participating countries.
Draw Number: 36
European Prize Breakdown
| Numbers Matched | Prize Per Winner | Winners from Croatia | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
kn74,000,000 | 0 | kn0 | 0 |
|
Match 5 and 1 Euro Number |
kn3,882,135.71 | 0 | kn0 | 3 |
|
Match 5 |
kn411,049.65 | 0 | kn0 | 10 |
|
Match 4 and 2 Euro Numbers |
kn32,622.33 | 0 | kn0 | 42 |
|
Match 4 and 1 Euro Number |
kn1,654.57 | 13 | kn21,509.41 | 745 |
|
Match 4 |
kn620.56 | 40 | kn24,822.40 | 1,545 |
|
Match 3 and 2 Euro Numbers |
kn454.28 | 34 | kn15,445.52 | 1,809 |
|
Match 2 and 2 Euro Numbers |
kn169.24 | 471 | kn79,712.04 | 25,008 |
|
Match 3 and 1 Euro Number |
kn135.10 | 637 | kn86,058.70 | 30,269 |
|
Match 3 |
kn93.53 | 1,499 | kn140,201.47 | 62,653 |
|
Match 1 and 2 Euro Numbers |
kn80.17 | 2,259 | kn181,104.03 | 133,214 |
|
Match 2 and 1 Euro Number |
kn61.61 | 8,804 | kn542,414.44 | 424,482 |
|
Total |
- | 13,757 | kn1,091,268.01 | 679,780 |
Eurojackpot prizes in Croatia must be claimed within 60 days of the draw date, so tickets purchased for this draw were valid until Tuesday 6th November 2018.
The estimated jackpot advertised in Croatia prior to the draw was kn74,000,000.
| Numbers Matched | Prize Per Winner | Winners from Czech Republic | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
Kc257,000,000 | 0 | Kc0 | 0 |
|
Match 5 and 1 Euro Number |
Kc13,438,274 | 0 | Kc0 | 3 |
|
Match 5 |
Kc1,422,876 | 0 | Kc0 | 10 |
|
Match 4 and 2 Euro Numbers |
Kc112,924 | 1 | Kc112,924 | 42 |
|
Match 4 and 1 Euro Number |
Kc5,727 | 20 | Kc114,540 | 745 |
|
Match 4 |
Kc2,148 | 17 | Kc36,516 | 1,545 |
|
Match 3 and 2 Euro Numbers |
Kc1,572 | 37 | Kc58,164 | 1,809 |
|
Match 2 and 2 Euro Numbers |
Kc585 | 399 | Kc233,415 | 25,008 |
|
Match 3 and 1 Euro Number |
Kc467 | 529 | Kc247,043 | 30,269 |
|
Match 3 |
Kc323 | 991 | Kc320,093 | 62,653 |
|
Match 1 and 2 Euro Numbers |
Kc277 | 2,370 | Kc656,490 | 133,214 |
|
Match 2 and 1 Euro Number |
Kc213 | 6,800 | Kc1,448,400 | 424,482 |
|
Total |
- | 11,164 | Kc3,227,585 | 679,780 |
Eurojackpot prizes in Czech Republic must be claimed within 35 days of the draw date, so tickets purchased for this draw were valid until Friday 12th October 2018.
The estimated jackpot advertised in Czech Republic prior to the draw was Kc0.
| Numbers Matched | Prize Per Winner | Winners from Denmark | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
kr.63,000,000 | 0 | kr.0 | 0 |
|
Match 5 and 1 Euro Number |
kr.3,334,102 | 1 | kr.3,334,102 | 3 |
|
Match 5 |
kr.353,049 | 1 | kr.353,049 | 10 |
|
Match 4 and 2 Euro Numbers |
kr.28,046 | 3 | kr.84,138 | 42 |
|
Match 4 and 1 Euro Number |
kr.1,450 | 62 | kr.89,900 | 745 |
|
Match 4 |
kr.562 | 117 | kr.65,754 | 1,545 |
|
Match 3 and 2 Euro Numbers |
kr.420 | 179 | kr.75,180 | 1,809 |
|
Match 2 and 2 Euro Numbers |
kr.171 | 2,187 | kr.373,977 | 25,008 |
|
Match 3 and 1 Euro Number |
kr.136 | 2,397 | kr.325,992 | 30,269 |
|
Match 3 |
kr.94 | 4,411 | kr.414,634 | 62,653 |
|
Match 1 and 2 Euro Numbers |
kr.81 | 11,486 | kr.930,366 | 133,214 |
|
Match 2 and 1 Euro Number |
kr.62 | 34,622 | kr.2,146,564 | 424,482 |
|
Total |
- | 55,466 | kr.8,193,656 | 679,780 |
Eurojackpot prizes in Denmark must be claimed within a set period of time depending on how much you have won. Visit the How to Claim page to find specific claim periods, with some prizes needing to be claimed within 90 days of the draw (valid until Thursday 6th December 2018).
The estimated jackpot advertised in Denmark prior to the draw was kr.63,000,000.
| Numbers Matched | Prize Per Winner | Winners from Estonia | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | 0 | €0 | 42 |
|
Match 4 and 1 Euro Number |
€222.90 | 2 | €445.80 | 745 |
|
Match 4 |
€83.60 | 6 | €501.60 | 1,545 |
|
Match 3 and 2 Euro Numbers |
€61.20 | 16 | €979.20 | 1,809 |
|
Match 2 and 2 Euro Numbers |
€22.80 | 203 | €4,628.40 | 25,008 |
|
Match 3 and 1 Euro Number |
€18.20 | 262 | €4,768.40 | 30,269 |
|
Match 3 |
€12.60 | 458 | €5,770.80 | 62,653 |
|
Match 1 and 2 Euro Numbers |
€10.80 | 1,064 | €11,491.20 | 133,214 |
|
Match 2 and 1 Euro Number |
€8.30 | 3,227 | €26,784.10 | 424,482 |
|
Total |
- | 5,238 | €55,369.50 | 679,780 |
Eurojackpot prizes in Estonia must be claimed within 90 days of the draw date, so tickets purchased for this draw were valid until Thursday 6th December 2018.
The estimated jackpot advertised in Estonia prior to the draw was €0.
| Numbers Matched | Prize Per Winner | Winners from Finland | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | At present this information is not released by the lottery operator of Finland | 42 | |
|
Match 4 and 1 Euro Number |
€222.90 | 745 | ||
|
Match 4 |
€83.60 | 1,545 | ||
|
Match 3 and 2 Euro Numbers |
€61.20 | 1,809 | ||
|
Match 2 and 2 Euro Numbers |
€22.80 | 25,008 | ||
|
Match 3 and 1 Euro Number |
€18.20 | 30,269 | ||
|
Match 3 |
€12.60 | 62,653 | ||
|
Match 1 and 2 Euro Numbers |
€10.80 | 133,214 | ||
|
Match 2 and 1 Euro Number |
€8.30 | 424,482 | ||
|
Total |
- | 679,780 |
Eurojackpot prizes in Finland must be claimed within 365 days of the draw date, so tickets purchased for this draw were valid until Saturday 7th September 2019.
The estimated jackpot advertised in Finland prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Germany | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 1 | €522,991.80 | 3 |
|
Match 5 |
€55,375.60 | 7 | €387,629.20 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | At present this information is not released by the lottery operator of Germany | 42 | |
|
Match 4 and 1 Euro Number |
€222.90 | 745 | ||
|
Match 4 |
€83.60 | 1,545 | ||
|
Match 3 and 2 Euro Numbers |
€61.20 | 1,809 | ||
|
Match 2 and 2 Euro Numbers |
€22.80 | 25,008 | ||
|
Match 3 and 1 Euro Number |
€18.20 | 30,269 | ||
|
Match 3 |
€12.60 | 62,653 | ||
|
Match 1 and 2 Euro Numbers |
€10.80 | 133,214 | ||
|
Match 2 and 1 Euro Number |
€8.30 | 424,482 | ||
|
Total |
- | 679,780 |
Eurojackpot prizes in Germany must be claimed within 3 years of the draw date, so tickets purchased for this draw are valid until Tuesday 7th September 2021.
The estimated jackpot advertised in Germany prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Hungary | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
Ft16,003,550 | 0 | Ft0 | 10 |
|
Match 4 and 2 Euro Numbers |
Ft1,270,095 | 1 | Ft1,270,095 | 42 |
|
Match 4 and 1 Euro Number |
Ft64,420 | 25 | Ft1,610,500 | 745 |
|
Match 4 |
Ft24,160 | 56 | Ft1,352,960 | 1,545 |
|
Match 3 and 2 Euro Numbers |
Ft17,685 | 37 | Ft654,345 | 1,809 |
|
Match 2 and 2 Euro Numbers |
Ft6,590 | 586 | Ft3,861,740 | 25,008 |
|
Match 3 and 1 Euro Number |
Ft5,260 | 789 | Ft4,150,140 | 30,269 |
|
Match 3 |
Ft3,640 | 2,101 | Ft7,647,640 | 62,653 |
|
Match 1 and 2 Euro Numbers |
Ft3,120 | 3,032 | Ft9,459,840 | 133,214 |
|
Match 2 and 1 Euro Number |
Ft2,400 | 10,401 | Ft24,962,400 | 424,482 |
|
Total |
- | 17,028 | Ft54,969,660 | 679,780 |
Eurojackpot prizes in Hungary must be claimed within 180 days of the draw date, so tickets purchased for this draw were valid until Wednesday 6th March 2019.
The estimated jackpot advertised in Hungary prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Iceland | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
kr.1,291,600,000 | 0 | kr.0 | 0 |
|
Match 5 and 1 Euro Number |
kr.67,549,620 | 0 | kr.0 | 3 |
|
Match 5 |
kr.7,152,310 | 0 | kr.0 | 10 |
|
Match 4 and 2 Euro Numbers |
kr.567,630 | At present this information is not released by the lottery operator of Iceland | 42 | |
|
Match 4 and 1 Euro Number |
kr.28,780 | 745 | ||
|
Match 4 |
kr.10,790 | 1,545 | ||
|
Match 3 and 2 Euro Numbers |
kr.7,900 | 1,809 | ||
|
Match 2 and 2 Euro Numbers |
kr.2,940 | 25,008 | ||
|
Match 3 and 1 Euro Number |
kr.2,350 | 30,269 | ||
|
Match 3 |
kr.1,620 | 62,653 | ||
|
Match 1 and 2 Euro Numbers |
kr.1,390 | 133,214 | ||
|
Match 2 and 1 Euro Number |
kr.1,070 | 424,482 | ||
|
Total |
- | 679,780 |
Eurojackpot prizes in Iceland must be claimed within 1 year of the draw date, so tickets purchased for this draw were valid until Saturday 7th September 2019.
The estimated jackpot advertised in Iceland prior to the draw was kr.0.
| Numbers Matched | Prize Per Winner | Winners from Italy | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | 2 | €8,789.60 | 42 |
|
Match 4 and 1 Euro Number |
€222.90 | 17 | €3,789.30 | 745 |
|
Match 4 |
€83.60 | 34 | €2,842.40 | 1,545 |
|
Match 3 and 2 Euro Numbers |
€61.20 | 49 | €2,998.80 | 1,809 |
|
Match 2 and 2 Euro Numbers |
€22.80 | 651 | €14,842.80 | 25,008 |
|
Match 3 and 1 Euro Number |
€18.20 | 745 | €13,559 | 30,269 |
|
Match 3 |
€12.60 | 1,514 | €19,076.40 | 62,653 |
|
Match 1 and 2 Euro Numbers |
€10.80 | 3,561 | €38,458.80 | 133,214 |
|
Match 2 and 1 Euro Number |
€8.30 | 10,888 | €90,370.40 | 424,482 |
|
Total |
- | 17,461 | €194,727.50 | 679,780 |
Eurojackpot prizes in Italy must be claimed within a set period of time depending on how much you have won. Visit the How to Claim page to find specific claim periods, with some prizes needing to be claimed within 30 days of the draw (valid until Sunday 7th October 2018).
The estimated jackpot advertised in Italy prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Latvia | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | At present this information is not released by the lottery operator of Latvia | 42 | |
|
Match 4 and 1 Euro Number |
€222.90 | 745 | ||
|
Match 4 |
€83.60 | 1,545 | ||
|
Match 3 and 2 Euro Numbers |
€61.20 | 1,809 | ||
|
Match 2 and 2 Euro Numbers |
€22.80 | 25,008 | ||
|
Match 3 and 1 Euro Number |
€18.20 | 30,269 | ||
|
Match 3 |
€12.60 | 62,653 | ||
|
Match 1 and 2 Euro Numbers |
€10.80 | 133,214 | ||
|
Match 2 and 1 Euro Number |
€8.30 | 424,482 | ||
|
Total |
- | 679,780 |
Eurojackpot prizes in Latvia must be claimed within 30 days of the draw date, so tickets purchased for this draw were valid until Sunday 7th October 2018.
The estimated jackpot advertised in Latvia prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Lithuania | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | 0 | €0 | 42 |
|
Match 4 and 1 Euro Number |
€222.90 | 3 | €668.70 | 745 |
|
Match 4 |
€83.60 | 6 | €501.60 | 1,545 |
|
Match 3 and 2 Euro Numbers |
€61.20 | 8 | €489.60 | 1,809 |
|
Match 2 and 2 Euro Numbers |
€22.80 | 82 | €1,869.60 | 25,008 |
|
Match 3 and 1 Euro Number |
€18.20 | 81 | €1,474.20 | 30,269 |
|
Match 3 |
€12.60 | 203 | €2,557.80 | 62,653 |
|
Match 1 and 2 Euro Numbers |
€10.80 | 408 | €4,406.40 | 133,214 |
|
Match 2 and 1 Euro Number |
€8.30 | 1,203 | €9,984.90 | 424,482 |
|
Total |
- | 1,994 | €21,952.80 | 679,780 |
Eurojackpot prizes in Lithuania must be claimed within 60 days of the draw date, so tickets purchased for this draw were valid until Tuesday 6th November 2018.
The estimated jackpot advertised in Lithuania prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Netherlands | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | At present this information is not released by the lottery operator of Netherlands | 42 | |
|
Match 4 and 1 Euro Number |
€222.90 | 745 | ||
|
Match 4 |
€83.60 | 1,545 | ||
|
Match 3 and 2 Euro Numbers |
€61.20 | 1,809 | ||
|
Match 2 and 2 Euro Numbers |
€22.80 | 25,008 | ||
|
Match 3 and 1 Euro Number |
€18.20 | 30,269 | ||
|
Match 3 |
€12.60 | 62,653 | ||
|
Match 1 and 2 Euro Numbers |
€10.80 | 133,214 | ||
|
Match 2 and 1 Euro Number |
€8.30 | 424,482 | ||
|
Total |
- | 679,780 |
Eurojackpot prizes in Netherlands must be claimed within 365 days of the draw date, so tickets purchased for this draw were valid until Saturday 7th September 2019.
The estimated jackpot advertised in Netherlands prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Norway | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
kr.97,000,000 | 0 | kr.0 | 0 |
|
Match 5 and 1 Euro Number |
kr.5,111,980 | 0 | kr.0 | 3 |
|
Match 5 |
kr.541,265 | 0 | kr.0 | 10 |
|
Match 4 and 2 Euro Numbers |
kr.42,955 | At present this information is not released by the lottery operator of Norway | 42 | |
|
Match 4 and 1 Euro Number |
kr.2,175 | 745 | ||
|
Match 4 |
kr.815 | 1,545 | ||
|
Match 3 and 2 Euro Numbers |
kr.595 | 1,809 | ||
|
Match 2 and 2 Euro Numbers |
kr.220 | 25,008 | ||
|
Match 3 and 1 Euro Number |
kr.175 | 30,269 | ||
|
Match 3 |
kr.120 | 62,653 | ||
|
Match 1 and 2 Euro Numbers |
kr.105 | 133,214 | ||
|
Match 2 and 1 Euro Number |
kr.80 | 424,482 | ||
|
Total |
- | 679,780 |
Eurojackpot prizes in Norway must be claimed within 3 months of the draw date, so tickets purchased for this draw were valid until Friday 7th December 2018.
The estimated jackpot advertised in Norway prior to the draw was kr.97,000,000.
| Numbers Matched | Prize Per Winner | Winners from Poland | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
zł43,000,000 | 0 | zł0 | 0 |
|
Match 5 and 1 Euro Number |
zł0 | 0 | zł0 | 3 |
|
Match 5 |
zł708,234.60 | 1 | zł708,234.60 | 10 |
|
Match 4 and 2 Euro Numbers |
zł18,993.50 | 1 | zł18,993.50 | 42 |
|
Match 4 and 1 Euro Number |
zł963.40 | 24 | zł23,121.60 | 745 |
|
Match 4 |
zł361.30 | 47 | zł16,981.10 | 1,545 |
|
Match 3 and 2 Euro Numbers |
zł264.50 | 65 | zł17,192.50 | 1,809 |
|
Match 2 and 2 Euro Numbers |
zł98.60 | 970 | zł95,642 | 25,008 |
|
Match 3 and 1 Euro Number |
zł78.70 | 1,093 | zł86,019.10 | 30,269 |
|
Match 3 |
zł54.50 | 2,173 | zł118,428.50 | 62,653 |
|
Match 1 and 2 Euro Numbers |
zł46.70 | 4,931 | zł230,277.70 | 133,214 |
|
Match 2 and 1 Euro Number |
zł35.90 | 16,033 | zł575,584.70 | 424,482 |
|
Total |
- | 25,338 | zł1,890,475.30 | 679,780 |
Eurojackpot prizes in Poland must be claimed within 3 years of the draw date, so tickets purchased for this draw are valid until Tuesday 7th September 2021.
The estimated jackpot advertised in Poland prior to the draw was zł43,000,000.
| Numbers Matched | Prize Per Winner | Winners from Slovakia | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 0 | €0 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | 1 | €4,394.80 | 42 |
|
Match 4 and 1 Euro Number |
€222.90 | 14 | €3,120.60 | 745 |
|
Match 4 |
€83.60 | 20 | €1,672 | 1,545 |
|
Match 3 and 2 Euro Numbers |
€61.20 | 27 | €1,652.40 | 1,809 |
|
Match 2 and 2 Euro Numbers |
€22.80 | 479 | €10,921.20 | 25,008 |
|
Match 3 and 1 Euro Number |
€18.20 | 523 | €9,518.60 | 30,269 |
|
Match 3 |
€12.60 | 1,145 | €14,427 | 62,653 |
|
Match 1 and 2 Euro Numbers |
€10.80 | 2,612 | €28,209.60 | 133,214 |
|
Match 2 and 1 Euro Number |
€8.30 | 8,116 | €67,362.80 | 424,482 |
|
Total |
- | 12,937 | €141,279 | 679,780 |
Eurojackpot prizes in Slovakia must be claimed within 35 days of the draw date, so tickets purchased for this draw were valid until Friday 12th October 2018.
The estimated jackpot advertised in Slovakia prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Spain | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
€10,000,000 | 0 | €0 | 0 |
|
Match 5 and 1 Euro Number |
€522,991.80 | 0 | €0 | 3 |
|
Match 5 |
€55,375.60 | 1 | €55,375.60 | 10 |
|
Match 4 and 2 Euro Numbers |
€4,394.80 | 3 | €13,184.40 | 42 |
|
Match 4 and 1 Euro Number |
€222.90 | 21 | €4,680.90 | 745 |
|
Match 4 |
€83.60 | 43 | €3,594.80 | 1,545 |
|
Match 3 and 2 Euro Numbers |
€61.20 | 62 | €3,794.40 | 1,809 |
|
Match 2 and 2 Euro Numbers |
€22.80 | 926 | €21,112.80 | 25,008 |
|
Match 3 and 1 Euro Number |
€18.20 | 1,053 | €19,164.60 | 30,269 |
|
Match 3 |
€12.60 | 1,912 | €24,091.20 | 62,653 |
|
Match 1 and 2 Euro Numbers |
€10.80 | 4,809 | €51,937.20 | 133,214 |
|
Match 2 and 1 Euro Number |
€8.30 | 15,327 | €127,214.10 | 424,482 |
|
Total |
- | 24,157 | €324,150 | 679,780 |
Eurojackpot prizes in Spain must be claimed within 30 days of the draw date, so tickets purchased for this draw were valid until Sunday 7th October 2018.
The estimated jackpot advertised in Spain prior to the draw was €10,000,000.
| Numbers Matched | Prize Per Winner | Winners from Sweden | Prize Fund Amount | Total Winners |
|---|---|---|---|---|
|
Match 5 and 2 Euro Numbers |
kr.107,000,000 | 0 | kr.0 | 0 |
|
Match 5 and 1 Euro Number |
kr.5,546,328 | 0 | kr.0 | 3 |
|
Match 5 |
kr.587,258 | 0 | kr.0 | 10 |
|
Match 4 and 2 Euro Numbers |
kr.227,865 | 1 | kr.227,865 | 42 |
|
Match 4 and 1 Euro Number |
kr.11,518 | 36 | kr.414,648 | 745 |
|
Match 4 |
kr.5,521 | 64 | kr.353,344 | 1,545 |
|
Match 3 and 2 Euro Numbers |
kr.2,640 | 91 | kr.240,240 | 1,809 |
|
Match 2 and 2 Euro Numbers |
kr.241 | 1,289 | kr.310,649 | 25,008 |
|
Match 3 and 1 Euro Number |
kr.193 | 1,429 | kr.275,797 | 30,269 |
|
Match 3 |
kr.133 | 2,632 | kr.350,056 | 62,653 |
|
Match 1 and 2 Euro Numbers |
kr.114 | 6,866 | kr.782,724 | 133,214 |
|
Match 2 and 1 Euro Number |
kr.88 | 21,154 | kr.1,861,552 | 424,482 |
|
Total |
- | 33,562 | kr.4,816,875 | 679,780 |
Eurojackpot prizes in Sweden must be claimed within 3 months of the draw date, so tickets purchased for this draw were valid until Friday 7th December 2018.
The estimated jackpot advertised in Sweden prior to the draw was kr.107,000,000.
Associated Draw Results
- 0
- 2
- 5
- 9
- 7
- 3
| Numbers Matched | Prize Per Winner | Total Winners |
|---|---|---|
| Match 6 in Exact Order | €50,000 | 1 |
| Match Last 5 in Exact Order | €5,000 | 0 |
| Match Last 4 in Exact Order | €500 | 9 |
| Match Last 3 in Exact Order | €50 | 86 |
| Match Last 2 in Exact Order | €5 | 913 |
| Match Last 1 in Exact Order | €3 | 8,630 |
- 7
- 4
- 9
- 2
- 3
- 8
| Numbers Matched | Prize Per Winner | Total Winners |
|---|---|---|
| Match 6 | CZK0 | 0 |
| Match 5 | CZK0 | 0 |
| Match 4 | CZK20,000 | 5 |
| Match 3 | CZK2,000 | 54 |
| Match 2 | CZK200 | 546 |
| Match 1 | CZK120 | 5,719 |
- 5
- 1
- 6
- 8
- 6
- 8
- 6
| Numbers Matched | Prize Per Winner | Total Winners |
|---|---|---|
| Match 7 in Exact Order | €1,000,000 | 0 |
| Match Any 6 in the Right Spot | €20,000 | 2 |
| Match Any 5 in the Right Spot | €500 | 39 |
| Match Any 4 in the Right Spot | €50 | 488 |
| Match Any 3 in the Right Spot | €6 | 4,254 |
| Match Any 2 in the Right Spot | €3 | 22,903 |
- Sao Paulo
- 85
| Numbers Matched | Prize Per Winner | Total Winners |
|---|---|---|
| City and Number | €1,000 | 9 |
| City | €5 | 1,120 |
- 1
- 1
- 5
- 0
- 3
| Numbers Matched | Prize Per Winner | Total Winners |
|---|---|---|
| Match 5 in Exact Order | kr2,000,000 | 0 |
| Match First/Last 4 in Exact Order | kr100,000 | 2 |
| Match First/Last 3 in Exact Order | kr10,000 | 13 |
| Match First/Last 2 in Exact Order | kr2,000 | 118 |
- Tvedestrand
Related Eurojackpot Results Links
- Automatically check your Eurojackpot ticket
- View average prizes and winners for each prize tiers
- View the largest jackpot winners and total winners from each country
- View previous Eurojackpot results by year
Buy Eurojackpot Tickets Online
By buying your Eurojackpot tickets online you don’t have to worry about ever losing your Eurojackpot lottery tickets. When you play the Eurojackpot online all your lottery tickets purchased on the internet are stored in your personal account, meaning that you can view them anytime you wish.


Select Duty
The Praetorium
Castrum Meridianum
(E12S) Eden's Promise Eternity Savage
(E8S) Eden's Verse Refulgence Savage
(Emerald Weapon) Castrum Marinum
(Ruby Weapon) Cinder Drift
(TEA) The Epic of Alexander
(O8S) Sigmasacpe V4 Savage
(E1) Eden's Gate Resurrection
Orbonne Monastery
Custom Duty
Installation Type:
SSD (default)
HDD
Customize Duty
Cutscene Name
Cutscene Duration (in milliseconds)
Add Cutscene
Reset Customizations
Customize Duty
Begin Duty
Source Code on Github
Your browser does not support the audio element.
Waiting for first cutscene to start
Reset Duty
Start Cutscene
Source Code on Github


public class KMVAttackInflation
extends java.lang.Object
| Constructor and Description |
|---|
KMVAttackInflation() |
| Modifier and Type | Method and Description |
|---|---|
private static java.util.ArrayList<java.lang.Double> |
createSet(int finalCardinal,
org.apache.datasketches.theta.UpdateSketchBuilder builder,
java.util.Random random,
boolean rand)
Creates the original set with all the elements and calculates the initial reduced set I
by including each element into the sketch and retaining only those that produce an increase
in the estimation.
|
static void |
main(java.lang.String[] args)
Implements the inflation algorithm from the paper for different cardinalities.
|
static java.util.ArrayList<java.lang.Double> |
reduceSet(java.util.ArrayList<java.lang.Double> iAttack,
org.apache.datasketches.theta.UpdateSketchBuilder builder)
Creates a more reduced Attack set A from the initial reduced set I
by reversing the set, including each element into the sketch and retaining only those that produce an increase
in the estimation.
|
private static double[] |
validateSet(java.util.ArrayList<java.lang.Double> aAttack,
org.apache.datasketches.theta.UpdateSketchBuilder builder)
Insert all the elements from the Attack set into an empty sketch and
then calculates the estimation and the number of retained entries in the sketch.
|
public static void main(java.lang.String[] args)
args
- Command line arguments. Optional. If present, they should include the value of K and selection between random/sequential values for the initial set.
E.g. 1024 seq sets K=1024 and sequential values.private static double[] validateSet(java.util.ArrayList<java.lang.Double> aAttack, org.apache.datasketches.theta.UpdateSketchBuilder builder)
aAttack
- Attack set as an ArrayListbuilder
- Configured element in charge of building the sketchprivate static final java.util.ArrayList<java.lang.Double> createSet(int finalCardinal, org.apache.datasketches.theta.UpdateSketchBuilder builder, java.util.Random random, boolean rand)
finalCardinal
- Initial cardinality of the original set that will be reducedbuilder
- Configured element in charge of building the sketchrandom
- Generator of the finalCardinal elements in a pseudo-random wayrand
- If true, random parameter is used. Otherwise, sequential integer elements are fed into the initial set.public static final java.util.ArrayList<java.lang.Double> reduceSet(java.util.ArrayList<java.lang.Double> iAttack, org.apache.datasketches.theta.UpdateSketchBuilder builder)
iAttack
- Initial attack set as an ArrayList that will be further reduced.builder
- Configured element in charge of building the sketch


Rainbow Wahine basketball team ekes out win over Pepperdine | Honolulu Star-Advertiser
The Hawaii women’s basketball team held on Friday night for a split of its two-game trip against West Coast Conference opposition. Just barely. Read more
Mahalo for reading the Honolulu Star-Advertiser!
You're reading a premium story. Read the full story with our Print & Digital Subscription.
Already a subscriber? Log in now to continue reading this story.
Print subscriber but without online access? Activate your Digital Account now.


Module Sound
The Sound
class lets you load and play WAV or MP3 sound files.
Control of the playing sound is performed through the SoundChannel
object.
Examples
local sound = Sound.new("music.mp3")
local channel = sound:play()
-- after some time --
channel:stop()
Type Sound
| Sound:getLength() |
Returns the duration of the sound in miliseconds. |
| Sound.new(filename) |
Creates a new |
| Sound:play(startTime, loops) |
Creates a new |
Type Sound
Field(s)
- Sound:getLength()
-
Returns the duration of the sound in miliseconds.
Return value
The duration of the sound in miliseconds.
- Sound.new(filename)
-
Creates a new
Sound
object.Parameter
-
filename
: (string) The name of the sound file to be loaded.
Return value
-
- Sound:play(startTime, loops)
-
Creates a new
SoundChannel
object to play the sound.By using the retured
SoundChannel
object, you can stop the sound and monitor the position.Parameters
-
startTime
: (number, default = 0) The initial position in milliseconds at which playback should start. -
loops
: (number, default = 0) Defines the number of times a sound play to the begining before the sound channel stops playback. For example, a value of 0 and 1 will play once, 2 will play twice and so on.
Return value
A
SoundChannel
object, which you use to control the sound. This function returnsnil
if you run out of available sound channels. -


CPU On both servers
OpenAPI hostgroups:=================>
OpenAPI hosts:=================>
IAM usergroup:=================>


|
You can add in the following strings to include information from the origin workbook or worksheet:
|
||
|
Use this field if you only want to include certain sheets in the workbooks. Enter the names of the sheets that you want to include from each workbook. Only enter one sheet name on each line. Each name will be case sensitive. You may also add JavaScript regular expressions (eg.
/Sheet #[1-3]$/i ). |
||


Amazing recipes
JavaScript -Milliters to cups-
Insert a number into one of the input fields below:
milliliters
Cups


My Week
-
06/20
-
06/21
Events
Weekly Sales meeting
10:00AM - 11:00AM
John Doe
Opportunity #1232213
Weekly Sales meeting
10:00AM - 11:00AM
John Doe
Opportunity #1232213
Tasks
Weekly Sales meeting
Weekly Sales meeting
Events
Weekly Sales meeting
10:00AM - 11:00AM
John Doe
Opportunity #1232213


This app is downloading and installing an update please wait!
If app taking a long time to update please download the latest release from GitHub.


Force.js
Finally, an easy way to animate elements and jump around on your page.
It has different easing functions (listed below) and tries (by default) to use CSS-Transitions to animate elements.
If the browser doesn't support transitions, force.js fallback to native javascript functions.
Force.js support even older browser version with no transition support.
To use it on your page, just write this line of code in the HTML HEAD
or on the bottom of the BODY
tag.
<script src="force.js" type="text/javascript"></script>
Support for AMD and Node Module Pattern (Including browserify)
Get it on Bower
bower install force-js
jQuery
Force.js is 100% pure vanilla!!!
But for all the coders who don't want to miss jQuery.
Force.js automatically detects jQuery and extend its Objects with the force.move() and force.jump() function.
So you are able to use force.js in an jQuery object.
$('#ball').move({left: 100px, top: 50px}, 1000);
To use force.js in jQuery, write the jQuery TAG first. So force.js can extend its objects afterwards.


Home
Menu
Order
Input the price of your pizza:
Type
Price
Onions
$ 1.50
Capers
$ 1.80
Potato
$ 1.64
Onions
Capers
Potato
Choose your favorite toppings:
Place Order
Total Charge
Want your pizza delivered?
Yes
No
Place another Order


My second emulator
For my second emulator in 2013 I decided to implement the Intel 8080 CPU, which was used by Space Invaders
SDL is used to draw the graphics
In it's current state it only compiles in Windows
My first emulator
A simple but usable CHIP-8 emulator
SDL is used to draw the graphics
Compiles in Windows & Linux with GTK 3
VPN service
Some classmates needed a VPN to bypass a firewall, so I decided to build a service for them.
University project
First year university assigment
Software to manage flights
University project
Third year university assigment
Website platform to manage CV and search them.
Uses NLTK, IBM Alchemy and regex rules to parse and extract userful information form CVs (python)
The search engine is Elasticsearch
The website runs on Spring (java)
University research
Android App to detect infractions while driving
Uses OpenCV and KNN to recognize traffic signs


Welcome to SKiDL’s documentation!¶
skidl¶
SKiDL is a module that allows you to compactly describe the interconnection of electronic circuits and components using Python. The resulting Python program performs electrical rules checking for common mistakes and outputs a netlist that serves as input to a PCB layout tool.
- Free software: MIT license
- Documentation: http://xesscorp.github.io/skidl
Features¶
- Has a powerful, flexible syntax (because it is Python).
- Permits compact descriptions of electronic circuits (think about not tracing signals through a multi-page schematic).
- Allows textual descriptions of electronic circuits (think about using
diff
and git for circuits). - Performs electrical rules checking (ERC) for common mistakes (e.g., unconnected device I/O pins).
- Supports linear / hierarchical / mixed descriptions of electronic designs.
- Fosters design reuse (think about using PyPi and Github to distribute electronic designs).
- Makes possible the creation of smart circuit modules whose behavior / structure are changed parametrically (think about filters whose component values are automatically adjusted based on your desired cutoff frequency).
- Can work with any ECAD tool (only two methods are needed: one for reading the part libraries and another for outputing the correct netlist format).
- Takes advantage of all the benefits of the Python ecosystem (because it is Python).
As a very simple example, the SKiDL program below describes a circuit that takes an input voltage, divides it by three, and outputs it:
from skidl import *
gnd = Net('GND') # Ground reference.
vin = Net('VI') # Input voltage to the divider.
vout = Net('VO') # Output voltage from the divider.
r1, r2 = 2 * Part('device', 'R', TEMPLATE) # Create two resistors.
r1.value, r1.footprint = '1K', 'Resistors_SMD:R_0805' # Set resistor values
r2.value, r2.footprint = '500', 'Resistors_SMD:R_0805' # and footprints.
r1[1] += vin # Connect the input to the first resistor.
r2[2] += gnd # Connect the second resistor to ground.
vout += r1[2], r2[1] # Output comes from the connection of the two resistors.
generate_netlist()
And this is the output that can be fed to a program like KiCad’s PCBNEW
to
create the physical PCB:
(export (version D)
(design
(source "C:/Users/DEVB/PycharmProjects/test1\test.py")
(date "08/12/2016 11:13 AM")
(tool "SKiDL (0.0.1)"))
(components
(comp (ref R1)
(value 1K)
(footprint Resistors_SMD:R_0805))
(comp (ref R2)
(value 500)
(footprint Resistors_SMD:R_0805)))
(nets
(net (code 0) (name "VI")
(node (ref R1) (pin 1)))
(net (code 1) (name "GND")
(node (ref R2) (pin 2)))
(net (code 2) (name "VO")
(node (ref R1) (pin 2))
(node (ref R2) (pin 1))))
)
Caveats¶
Before working with SKiDL, please realize that it is still under development and features are missing and/or likely to change. The most notable missing feature is the lack of back annotation where changes made to a circuit during PCB layout are reflected back into the schematic (or, in our case, the SKiDL program).
Also, while SKiDL-generated netlists have been brought into KiCad’s PCBNEW layout editor and manipulated, no physical PCBs have yet been fabricated.
Installation¶
SKiDL is pure Python so it’s easy to install:
$ pip install skidl
or:
$ easy_install skidl
Usage¶
Scratching the Surface¶
This is the minimum that you need to know to design electronic circuitry using SKiDL:
- How to get access to SKiDL.
- How to find and instantiate a component (or part).
- How to connect pins of the parts to each other using nets.
- How to run an ERC on the circuit.
- How to generate a netlist for the circuit that serves as input to a PCB layout tool.
I’ll demonstrate these steps using SKiDL in an interactive Python session, but normally the statements that are shown would be entered into a file and executed as a Python script.
Accessing SKiDL¶
To use skidl in a project, just place the following at the top of your file:
import skidl
But for this tutorial, I’ll just import everything:
from skidl import *
Finding Parts¶
SKiDL provides a convenience function for searching for parts called
(naturally) search
. Suppose you want to use a resistor, but don’t know
what the name of the part is. Assuming it probably starts with “R”, search
can be used to do a wildcard search of the part libraries:
>>> search('R.*')
bbd.lib: RD5106A
conn.lib: RJ12
conn.lib: RJ45
conn.lib: RJ45-TRANSFO
conn.lib: RJ45_LEDS
device.lib: R
device.lib: RELAY_2RT
device.lib: RF_SHIELD_ONE_PIECE
device.lib: RF_SHIELD_TWO_PIECES
...
references.lib: REF3212AMDBVREP
references.lib: REF5020AD
references.lib: REF5020ADGK
rfcom.lib: RN42
rfcom.lib: RN42N
>>>
Or suppose you want an LM358 opamp:
>>> search('LM358')
linear.lib: LM358
In addition to part names, SKiDL’s search
function also scans over the description and keywords for all
the parts, making it easy to find things like transistors and opamps:
>>> skidl.search('.*opamp.*')
linear.lib: LM386
linear.lib: MCP601
linear.lib: MCP601R
linear.lib: AD620
linear.lib: LTC6082
Once you have the part name and library, you can see the part’s pin numbers, names
and their functions using the show
function:
>>> show('device','R')
R:
Pin 1/~: PASSIVE
Pin 2/~: PASSIVE
>>> show('linear','LM358')
LM358:
Pin 4/V-: POWER-IN
Pin 8/V+: POWER-IN
Pin 1/~: OUTPUT
Pin 2/-: INPUT
Pin 3/+: INPUT
Pin 5/+: INPUT
Pin 6/-: INPUT
Pin 7/~: OUTPUT
Instantiating Parts¶
The part library and name are used to instantiate a part as follows:
>>> resistor = Part('device','R')
You can customize the resistor by setting its attributes:
>>> resistor.value = '1K'
>>> resistor.value
'1K'
You can also combine the setting of attributes with the creation of the part:
>>> resistor = Part('device', 'R', value='1K')
>>> resistor.value
'1K'
You can use any valid Python name for a part attribute, but ref
, value
,
and footprint
are necessary in order to generate the final netlist
for your circuit. And the attribute can hold any type of Python object,
but simple strings are probably the most useful.
The ref
attribute holds the reference for the part. It’s set automatically
when you create the part:
>>> resistor.ref
'R1'
Since this was the first resistor we created, it has the honor of being named R1
.
But you can easily change it:
>>> resistor.ref = 'R5'
>>> resistor.ref
'R5'
Now what happens if we create another resistor?:
>>> another_res = Part('device','R')
>>> another_res.ref
'R1'
Since the R1
reference was now available, the new resistor got it.
What if we tried renaming the first resistor back to R1
:
>>> resistor.ref = 'R1'
>>> resistor.ref
'R1_1'
Since the R1
reference was already taken, SKiDL tried to give us
something close to what we wanted.
SKiDL won’t let different parts have the same reference because
that would confuse the hell out of everybody.
Connecting Pins¶
Parts are great and all, but not very useful if they aren’t connected to anything. The connections between parts are called nets (think of them as wires) and every net has one or more part pins on it. SKiDL makes it easy to create nets and connect pins to them. To demonstrate, let’s build the voltage divider circuit shown in the introduction.
First, start by creating two resistors (note that I’ve also added the
footprint
attribute that describes the physical package for the resistors):
>>> rup = Part('device', 'R', value='1K', footprint='Resistors_SMD:R_0805')
>>> rlow = Part('device', 'R', value='500', footprint='Resistors_SMD:R_0805')
>>> rup.ref, rlow.ref
('R1', 'R2')
>>> rup.value, rlow.value
('1K', '500')
To bring the voltage that will be divided into the circuit, let’s create a net:
>>> v_in = Net('VIN')
>>> v_in.name
'VIN'
Now attach the net to one of the pins of the rup
resistor
(resistors are bidirectional which means it doesn’t matter which pin, so pick pin 1):
>>> rup[1] += v_in
You can verify that the net is attached to pin 1 of the resistor like this:
>>> rup[1].net
VIN: Pin 1/~: PASSIVE
Next, create a ground reference net and attach it to rlow
:
>>> gnd = Net('GND')
>>> rlow[1] += gnd
>>> rlow[1].net
GND: Pin 1/~: PASSIVE
Finally, the divided voltage has to come out of the circuit on a net. This can be done in several ways. The first way is to define the output net and then attach the unconnected pins of both resistors to it:
>>> v_out = Net('VO')
>>> v_out += rup[2], rlow[2]
>>> rup[2].net, rlow[2].net
(VO: Pin 2/~: PASSIVE, Pin 2/~: PASSIVE, VO: Pin 2/~: PASSIVE, Pin 2/~: PASSIVE)
An alternate method is to connect the resistors and then attach their junction to the output net:
>>> rup[2] += rlow[2]
>>> v_out = Net('VO')
>>> v_out += rlow[2]
>>> rup[2].net, rlow[2].net
(VO: Pin 2/~: PASSIVE, Pin 2/~: PASSIVE, VO: Pin 2/~: PASSIVE, Pin 2/~: PASSIVE)
Either way works! Sometimes pin-to-pin connections are easier when you’re just wiring two devices together, while the pin-to-net connection method excels when three or more pins have a common connection.
Checking for Errors¶
Once the parts are wired together, you can do simple electrical rules checking like this:
>>> ERC()
2 warnings found during ERC.
0 errors found during ERC.
Since this is an interactive session, the ERC warnings and errors are stored
in the file skidl.erc
. (Normally, your SKiDL circuit description is stored
as a Python script such as my_circuit.py
and the ERC()
function will
dump its messages to my_circuit.erc
.)
The ERC messages are:
WARNING: Only one pin (PASSIVE pin 1/~ of R/R1) attached to net VIN.
WARNING: Only one pin (PASSIVE pin 1/~ of R/R2) attached to net GND.
These messages are generated because the VIN
and GND
nets each have only
a single pin on them and this usually indicates a problem.
But it’s OK for this simple example, so the ERC can be turned off for
these two nets to prevent the spurious messages:
>>> v_in.do_erc = False
>>> gnd.do_erc = False
>>> ERC()
No ERC errors or warnings found.
Generating a Netlist¶
The end goal of using SKiDL is to generate a netlist that can be used with a layout tool to generate a PCB. The netlist is output as follows:
>>> generate_netlist()
Like the ERC output, the netlist shown below is stored in the file skidl.net
.
But if your SKiDL circuit description is in the my_circuit.py
file,
then the netlist will be stored in my_circuit.net
.
(export (version D)
(design
(source "C:\xesscorp\KiCad\tools\skidl\skidl\skidl.py")
(date "08/12/2016 10:05 PM")
(tool "SKiDL (0.0.1)"))
(components
(comp (ref R1)
(value 1K)
(footprint Resistors_SMD:R_0805))
(comp (ref R2)
(value 500)
(footprint Resistors_SMD:R_0805)))
(nets
(net (code 0) (name "VIN")
(node (ref R1) (pin 1)))
(net (code 1) (name "GND")
(node (ref R2) (pin 1)))
(net (code 2) (name "VO")
(node (ref R1) (pin 2))
(node (ref R2) (pin 2))))
)
You can also generate the netlist in XML format:
>>> generate_xml()
This is useful in a KiCad environment where the XML file is used as the input to BOM-generation tools.
 This section will talk about some more advanced features.
Basic SKiDL Objects: Parts, Pins, Nets, and Buses¶
SKiDL uses four types of objects to represent a circuit: Part
, Pin
,
Net
, and Bus
.
The Part
object represents an electronic component, which SKiDL thinks of as simple
bags of Pin
objects with a few other attributes attached
(like the part number, name, reference, value, footprint, etc.).
The Pin
object represents a terminal that brings an electronic signal into
and out of the part. Each Pin
object has two important attributes:
part
which stores the reference to thePart
object to which the pin belongs.net
which stores the the reference to theNet
object that the pin is connected to, orNone
if the pin is unconnected.
A Net
object is kind of like a Part
: it’s a simple bag of pins.
The difference is, unlike a part, pins can be added to a net.
This happens when a pin on some part is connected to the net or when the
net is merged with another net.
Finally, a Bus
is just a list of Net
objects.
A bus of a certain width can be created from a number of existing nets,
newly-created nets, or both.
Creating SKiDL Objects¶
Here’s the most common way to create a part in your circuit:
my_part = Part('some_library', 'some_part_name')
When this is processed, the current directory will be checked for a file
called some_library.lib
which will be opened and scanned for a part with the
name some_part_name
. If the file is not found or it doesn’t contain
the requested part, then the process will be repeated using KiCad’s default
library directory.
(You can change SKiDL’s library search by changing the list of directories
stored in the skidl.lib_search_paths_kicad list.)
You’re not restricted to using only the current directory or the KiCad default directory to search for parts. You can also search any file for a part by using a full file name:
my_part = Part('C:/my_libs/my_great_parts.lib', 'my_super_regulator')
You’re also not restricted to getting an exact match on the part name: you can use a regular expression instead. For example, this will find a part with “358” anywhere in a part name or alias:
my_part = Part('some_library', '.*358.*')
If the regular expression matches more than one part, then you’ll only get the first match and a warning that multiple parts were found.
Once you have a part, you can set its attributes like you could for any Python
object. As was shown previously, the ref
attribute will already be set
but you can override it:
my_part.ref = 'U5'
The value
and footprint
attributes are also required for generating
a netlist. But you can also add any other attribute:
my_part.manf = 'Atmel'
my_part.setattr('manf#', 'ATTINY4-TSHR'
It’s also possible to set the attributes during the part creation:
my_part = Part('some_lib', 'some_part', ref='U5', footprint='SMD:SOT23_6', manf='Atmel')
Creating nets is also simple:
my_net = Net() # An unnamed net.
my_other_net = Net('Fred') # A named net.
As with parts, SKiDL will alter the name you assign to a net if it collides with another net having the same name.
You can create a bus of a certain width like this:
my_bus = Bus('bus_name', 8) # Create a byte-wide bus.
(All buses must be named, but SKiDL will look for and correct colliding bus names.)
You can also create a bus from existing nets, or buses, or the pins of parts:
my_part = Part('linear', 'LM358')
a_net = Net()
b_net = Net()
bus_nets = Bus('net_bus', a_net, b_net) # A 2-bit bus.
bus_pins = Bus('pin_bus', my_part[1], my_part[3]) # A 2-bit bus.
bus_buses = Bus('bus_bus', my_bus) # An 8-bit bus.
Finally, you can mix-and-match any combination of widths, nets, buses or part pins:
bus_mixed = Bus('mongrel', 8, a_net, my_bus, my_part[2]) # 8+1+8+1 = 18-bit bus.
The final object you can create is a Pin
. You’ll probably never do this
(except in interactive sessions), and it’s probably a mistake if
you ever do do it, but here’s how to do it:
>>> p = Pin(num=1, name='my_pin', func=Pin.TRISTATE)
>>> p
Pin 1/my_pin: TRISTATE
Copying SKiDL Objects¶
Instead of creating a SKiDL object from scratch, sometimes it’s easier to just copy an existing object. Here are some examples of creating a resistor and then making some copies of it:
>>> r1 = Part('device', 'R', value=500)
>>> r2 = r1.copy() # Make a single copy of the resistor.
>>> r3 = r1.copy(value='1K') # Make a single copy, but give it a different value.
>>> r4 = r1(value='1K') # You can also call the object directly to make copies.
>>> r5, r6, r7 = r1(3) # Make 3 copies of the resistor.
>>> r8, r9, r10 = r1(value=[110,220,330]) # Make 3 copies, each with a different value.
>>> r11, r12 = 2 * r1 # Make copies using the '*' operator.
In some cases it’s clearer to create parts by copying a template part that doesn’t actually get included in the netlist for the circuitry. This is done like so:
>>> r_template = Part('device', 'R', dest=TEMPLATE) # Create a resistor just for copying.
>>> r1 = r_template(value='1K') # Make copy that becomes part of the actual circuitry.
Accessing Part Pins and Bus Lines¶
You can access the pins on a part or the individual nets of a bus using numbers, slices, strings, and regular expressions, either singly or in any combination.
Suppose you have a PIC10 processor in a six-pin package:
>>> pic10 = Part('microchip_pic10mcu', 'pic10f220-i/ot')
>>> pic10
PIC10F220-I/OT:
Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL
Pin 2/VSS: POWER-IN
Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL
Pin 5/VDD: POWER-IN
Pin 6/Vpp/~MCLR~/GP3: INPUT
The most natural way to access one of its pins is to give the pin number in brackets:
>>> pic10[3]
Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
(If you have a part in a BGA package with pins numbers like C11
, then
you’ll have to enter the pin number as a quoted string like 'C11'
.)
You can also get several pins at once in a list:
>>> pic10[3,1,6]
[Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 6/Vpp/~MCLR~/GP3: INPUT]
You can even use Python slice notation:
>>> pic10[2:4] # Get pins 2 through 4.
[Pin 2/VSS: POWER-IN, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL]
>>> pic10[4:2] # Get pins 4 through 2.
[Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 2/VSS: POWER-IN]
>>> pic10[:] # Get all the pins.
[Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 2/VSS: POWER-IN, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 5/VDD: POWER-IN, Pin 6/Vpp/~MCLR~/GP3: INPUT]
(It’s important to note that the slice notation used by SKiDL for parts is slightly
different than standard Python. In Python, a slice n:m
would fetch indices
n
, n+1
, ...
, m-1
. With SKiDL, it actually fetches all the
way up to the last number: n
, n+1
, ...
, m-1
, m
.
The reason for doing this is that most electronics designers are used to
the bounds on a slice including both endpoints. Perhaps it is a mistake to
do it this way. We’ll see...)
Instead of pin numbers, sometimes it makes the design intent more clear to access pins by their names. For example, it’s more obvious that a voltage supply net is being attached to the power pin of the processor when it’s expressed like this:
pic10['VDD'] += supply_5V
You can use multiple names or regular expressions to get more than one pin:
>>> pic10['VDD','VSS']
[Pin 5/VDD: POWER-IN, Pin 2/VSS: POWER-IN]
>>> pic10['.*GP[1-3]']
[Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 6/Vpp/~MCLR~/GP3: INPUT]
It can be tedious and error prone entering all the quote marks if you’re accessing many pin names. SKiDL lets you enter a single, comma-delimited string of pin names:
>>> pic10['.*GP0, .*GP1, .*GP2']
[Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL]
Part
objects also provide the get_pins()
function which can select pins in even more ways.
For example, this would get every bidirectional pin of the processor:
>>> pic10.get_pins(func=Pin.BIDIR)
[Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL]
However, slice notation doesn’t work with pin names. You’ll get an error if you try that.
Accessing the individual nets of a bus works similarly to accessing part pins:
>>> a = Net('NET_A') # Create a named net.
>>> b = Bus('BUS_B', 8, a) # Create a nine-bit bus.
>>> b
BUS_B:
BUS_B0: # Note how the individual nets of the bus are named.
BUS_B1:
BUS_B2:
BUS_B3:
BUS_B4:
BUS_B5:
BUS_B6:
BUS_B7:
NET_A: # The last net retains its original name.
>>> b[0] # Get the first net of the bus.
BUS_B0:
>>> b[4,8] # Get the fifth and ninth bus lines.
[BUS_B4: , NET_A: ]
>>> b[3:0] # Get the first four bus lines in reverse order.
[BUS_B3: , BUS_B2: , BUS_B1: , BUS_B0: ]
>>> b['BUS_B.*'] # Get all the bus lines except the last one.
[BUS_B0: , BUS_B1: , BUS_B2: , BUS_B3: , BUS_B4: , BUS_B5: , BUS_B6: , BUS_B7: ]
>>> b['NET_A'] # Get the last bus line.
NET_A:
Making Connections¶
Pins, nets, parts and buses can all be connected together in various ways, but the primary rule of SKiDL connections is:
The ``+=`` operator is the only way to make connections!
At times you’ll mistakenly try to make connections using the
assignment operator (=
). In many cases, SKiDL warns you if you do that,
but there are situations where it can’t (because
Python is a general-purpose programming language where
assignment is a necessary operation).
So remember the primary rule!
After the primary rule, the next thing to remember is that SKiDL’s main purpose is creating netlists. To that end, it handles four basic, connection operations:
- Pin-to-Net:
- A pin is connected to a net, adding it to the list of pins connected to that net. If the pin is already attached to other nets, then those nets are connected to this net as well.
- Net-to-Pin:
- This is the same as doing a pin-to-net connection.
- Pin-to-Pin:
- A net is created and both pins are attached to it. If one or both pins are already connected to other nets, then those nets are connected to the newly-created net as well.
- Net-to-Net:
- Connecting one net to another merges the pins on both nets onto a single, larger net.
There are three variants of each connection operation:
- One-to-One:
- This is the most frequent type of connection, for example, connecting one pin to another or connecting a pin to a net.
- One-to-Many:
- This mainly occurs when multiple pins are connected to the same net, like when multiple ground pins of a chip are connected to the circuit ground net.
- Many-to-Many:
- This usually involves bus connections to a part, such as connecting a bus to the data or address pins of a processor. But there must be the same number of things to connect in each set, e.g. you can’t connect three pins to four nets.
As a first example, let’s connect a net to a pin on a part:
>>> pic10 = Part('microchip_pic10mcu','pic10f220-i/ot') # Get a part.
>>> io = Net('IO_NET') # Create a net.
>>> pic10['.*GP0'] += io # Connect the net to a part pin.
>>> io # Show the pins connected to the net.
IO_NET: Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL
You can do the same operation in reverse by connecting the part pin to the net with the same result:
>>> pic10 = Part('microchip_pic10mcu','pic10f220-i/ot')
>>> io = Net('IO_NET')
>>> io += pic10['.*GP0'] # Connect a part pin to the net.
>>> io
IO_NET: Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL
You can also connect a pin directly to another pin.
In this case, an implicit net will be created between the pins that can be
accessed using the net
attribute of either part pin:
>>> pic10['.*GP1'] += pic10['.*GP2'] # Connect two pins together.
>>> pic10['.*GP1'].net # Show the net connected to the pin.
N$1: Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
>>> pic10['.*GP2'].net # Show the net connected to the other pin. Same thing!
N$1: Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
You can connect multiple pins together, all at once:
>>> pic10[1] += pic10[2,3,6]
>>> pic10[1].net
N$1: Pin 6/Vpp/~MCLR~/GP3: INPUT, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL, Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 2/VSS: POWER-IN
Or you can do it incrementally:
>>> pic10[1] += pic10[2]
>>> pic10[1] += pic10[3]
>>> pic10[1] += pic10[6]
>>> pic10[1].net
N$1: Pin 2/VSS: POWER-IN, Pin 6/Vpp/~MCLR~/GP3: INPUT, Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
If you connect pins on separate nets together, then all the pins are merged onto the same net:
>>> pic10[1] += pic10[2] # Put pins 1 & 2 on one net.
>>> pic10[1].net
N$1: Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 2/VSS: POWER-IN
>>> pic10[3] += pic10[4] # Put pins 3 & 4 on another net.
>>> pic10[3].net
N$2: Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
>>> pic10[1] += pic10[4] # Connect two pins from different nets.
>>> pic10[3].net # Now all the pins are on the same net!
N$2: Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL, Pin 2/VSS: POWER-IN, Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL, Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
Here’s an example of connecting a three-bit bus to three pins on a part:
>>> pic10 = Part('microchip_pic10mcu','pic10f220-i/ot')
>>> pic10
PIC10F220-I/OT:
Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL
Pin 2/VSS: POWER-IN
Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL
Pin 5/VDD: POWER-IN
Pin 6/Vpp/~MCLR~/GP3: INPUT
>>> b = Bus('GP', 3) # Create a 3-bit bus.
>>> pic10[4,3,1] += b[2:0] # Connect bus to part pins, one-to-one.
>>> b
GP:
GP0: Pin 1/ICSPDAT/AN0/GP0: BIDIRECTIONAL
GP1: Pin 3/ICSPCLK/AN1/GP1: BIDIRECTIONAL
GP2: Pin 4/T0CKI/FOSC4/GP2: BIDIRECTIONAL
But SKiDL will warn you if there aren’t the same number of things to connect on each side:
>>> pic10[4,3,1] += b[1:0] # Too few bus lines for the pins!
ERROR: Connection mismatch 3 != 2!
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "c:\xesscorp\kicad\tools\skidl\skidl\skidl.py", line 2630, in __iadd__
raise Exception
Exception
Hierarchy¶
SKiDL supports the encapsulation of parts, nets and buses into modules that can be replicated to reduce the design effort, and can be used in other modules to create a functional hierarchy. It does this using Python’s built-in machinery for defining and calling functions so there’s almost nothing new to learn.
As an example, here’s the voltage divider as a module:
from skidl import *
import sys
# Define the voltage divider module. The @SubCircuit decorator
# handles some skidl housekeeping that needs to be done.
@SubCircuit
def vdiv(inp, outp):
"""Divide inp voltage by 3 and place it on outp net."""
rup = Part('device', 'R', value='1K', footprint='Resistors_SMD:R_0805')
rlo = Part('device','R', value='500', footprint='Resistors_SMD:R_0805')
rup[1,2] += inp, outp
rlo[1,2] += outp, gnd
gnd = Net('GND') # GLobal ground net.
input_net = Net('IN') # Net with the voltage to be divided.
output_net = Net('OUT') # Net with the divided voltage.
# Instantiate the voltage divider and connect it to the input & output nets.
vdiv(input_net, output_net)
generate_netlist(sys.stdout)
For the most part, vdiv
is just a standard Python function:
it accepts inputs, it performs operations on them, and it could return
outputs (but in this case, it doesn’t need to).
Other than the @SubCircuit
decorator that appears before the function definition,
vdiv
is just a Python function and it can do anything that a Python function can do.
Here’s the netlist that’s generated:
(export (version D)
(design
(source "C:/Users/DEVB/PycharmProjects/test1\test.py")
(date "08/15/2016 03:35 PM")
(tool "SKiDL (0.0.1)"))
(components
(comp (ref R1)
(value 1K)
(footprint Resistors_SMD:R_0805))
(comp (ref R2)
(value 500)
(footprint Resistors_SMD:R_0805)))
(nets
(net (code 0) (name "IN")
(node (ref R1) (pin 1)))
(net (code 1) (name "OUT")
(node (ref R1) (pin 2))
(node (ref R2) (pin 1)))
(net (code 2) (name "GND")
(node (ref R2) (pin 2))))
)
For an example of a multi-level hierarchy, the multi_vdiv
module shown below
can use the vdiv
module to divide a voltage multiple times:
from skidl import *
import sys
# Define the voltage divider module.
@SubCircuit
def vdiv(inp, outp):
"""Divide inp voltage by 3 and place it on outp net."""
rup = Part('device', 'R', value='1K', footprint='Resistors_SMD:R_0805')
rlo = Part('device','R', value='500', footprint='Resistors_SMD:R_0805')
rup[1,2] += inp, outp
rlo[1,2] += outp, gnd
@SubCircuit
def multi_vdiv(repeat, inp, outp):
"""Divide inp voltage by 3 ** repeat and place it on outp net."""
for _ in range(repeat):
out_net = Net() # Create an output net for the current stage.
vdiv(inp, out_net) # Instantiate a divider stage.
inp = out_net # The output net becomes the input net for the next stage.
outp += out_net # Connect the output from the last stage to the module output net.
gnd = Net('GND') # GLobal ground net.
input_net = Net('IN') # Net with the voltage to be divided.
output_net = Net('OUT') # Net with the divided voltage.
multi_vdiv(3, input_net, output_net) # Run the input through 3 voltage dividers.
generate_netlist(sys.stdout)
(For the EE’s out there: yes, I know cascading three simple voltage dividers will not multiplicatively scale the input voltage because of the input and output impedances of each stage! It’s just the simplest example I could think of that shows the feature.)
And here’s the resulting netlist:
(export (version D)
(design
(source "C:/Users/DEVB/PycharmProjects/test1\test.py")
(date "08/15/2016 05:52 PM")
(tool "SKiDL (0.0.1)"))
(components
(comp (ref R1)
(value 1K)
(footprint Resistors_SMD:R_0805))
(comp (ref R2)
(value 500)
(footprint Resistors_SMD:R_0805))
(comp (ref R3)
(value 1K)
(footprint Resistors_SMD:R_0805))
(comp (ref R4)
(value 500)
(footprint Resistors_SMD:R_0805))
(comp (ref R5)
(value 1K)
(footprint Resistors_SMD:R_0805))
(comp (ref R6)
(value 500)
(footprint Resistors_SMD:R_0805)))
(nets
(net (code 0) (name "IN")
(node (ref R1) (pin 1)))
(net (code 1) (name "N$1")
(node (ref R2) (pin 1))
(node (ref R1) (pin 2))
(node (ref R3) (pin 1)))
(net (code 2) (name "GND")
(node (ref R4) (pin 2))
(node (ref R6) (pin 2))
(node (ref R2) (pin 2)))
(net (code 3) (name "N$2")
(node (ref R5) (pin 1))
(node (ref R3) (pin 2))
(node (ref R4) (pin 1)))
(net (code 4) (name "OUT")
(node (ref R5) (pin 2))
(node (ref R6) (pin 1))))
)
Doodads¶
SKiDL has a few features that don’t fit into any other category. Here they are.
No Connects¶
Sometimes you will use a part, but you won’t use every pin. The ERC will complain about those unconnected pins:
>>> pic10 = Part('microchip_pic10mcu','pic10f220-i/ot')
>>> ERC()
ERC WARNING: Unconnected pin: BIDIRECTIONAL pin 1/ICSPDAT/AN0/GP0 of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: POWER-IN pin 2/VSS of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: BIDIRECTIONAL pin 3/ICSPCLK/AN1/GP1 of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: BIDIRECTIONAL pin 4/T0CKI/FOSC4/GP2 of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: POWER-IN pin 5/VDD of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: INPUT pin 6/Vpp/~MCLR~/GP3 of PIC10F220-I/OT/IC1.
If you have pins that you intentionally want to leave unconnected, then
attach them to the special-purpose NC
(no-connect) net and the warnings will
be supressed:
>>> pic10[1,3,4] += NC
>>> ERC()
ERC WARNING: Unconnected pin: POWER-IN pin 2/VSS of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: POWER-IN pin 5/VDD of PIC10F220-I/OT/IC1.
ERC WARNING: Unconnected pin: INPUT pin 6/Vpp/~MCLR~/GP3 of PIC10F220-I/OT/IC1.
In fact, if you have a part with many pins that are not going to be used,
you can start off by attaching all the pins to the NC
net.
After that, you can attach the pins you’re using to normal nets and they
will be removed from the NC
net:
my_part[:] += NC # Connect every pin to NC net.
...
my_part[5] += Net() # Pin 5 is no longer unconnected.
The NC
net is the only net for which this happens.
For all other nets, connecting two or more nets to the same pin
merges those nets and all the pins on them together.
Net Drive Level¶
Certain parts have power pins that are required to be driven by a power supply net or else ERC warnings ensue. This condition is usually satisfied if the power pins are driven by the output of another part like a voltage regulator. But if the regulator output passes through something like a ferrite bead (to remove noise), then the filtered signal is no longer a supply net and an ERC warning is issued.
In order to satisfy the ERC, the drive strength of a net can be set manually
using its drive
attribute. As a simple example, consider connecting
a net to the power supply input of a processor and then running
the ERC:
>>> pic10 = Part('microchip_pic10mcu','pic10f220-i/ot')
>>> a = Net()
>>> pic10['VDD'] += a
>>> ERC()
...
ERC WARNING: Insufficient drive current on net N$1 for pin POWER-IN pin 5/VDD of PIC10F220-I/OT/IC1
...
This issue is fixed by changing the drive
attribute of the net:
>>> pic10 = Part('microchip_pic10mcu','pic10f220-i/ot')
>>> a = Net()
>>> pic10['VDD'] += a
>>> a.drive = POWER
>>> ERC()
...
(Insufficient drive warning is no longer present.)
...
You can set the drive
attribute at any time to any defined level, but POWER
is probably the only setting you’ll use.
Also, the drive
attribute retains the highest of all the levels it has been set at,
so once it is set to the POWER level it is impossible to set it to a lower level.
(This is done during internal processing to keep a net at the highest drive
level of any of the pins that have been attached to it.)
In short, for any net you create that supplies power to devices in your circuit,
you should probably set its drive
attribute to POWER
.
This is equivalent to attaching power flags to nets in some ECAD packages like KiCad.
Selectively Supressing ERC Messages¶
Sometimes a portion of your circuit throws a lot of ERC warnings or errors even though you know it’s correct.
Converting Existing Designs to SKiDL¶
If you have an existing schematic-based design, you can convert it to SKiDL as follows:
Generate a netlist file for your design using whatever procedure your ECAD system provides. For this discussion, call the netlist file
my_design.net
.Convert the netlist file into a SKiDL program using the following command:
netlist_to_skidl -i my_design.net -o my_design.py -w
That’s it! You can execute the my_design.py
script and it will regenerate the
netlist. Or you can use the script as a subcircuit in a larger design.
Or do anything else that a SKiDL-based design supports.
API¶
SKiDL: A Python-Based Schematic Design Language
This module extends Python with the ability to design electronic
circuits. It provides classes for working with 1) electronic parts (Part
),
2) collections of part terminals (Pin
) connected via wires (Net
), and
3) groups of related nets (Bus
). Using these classes, you can
concisely describe the interconnection of components using a linear
and/or hierarchical structure. It also provides the capability to
check the resulting circuitry for the violation of electrical rules.
The output of a SKiDL-enabled Python script is a netlist that can be
imported into a PCB layout tool.
-
class
skidl.skidl.
Alias
(name, id_tag=None)[source]¶ An alias can be added to another object to give it another name. Since an object might have several aliases, each alias can be tagged with an identifier to discriminate between them.
Parameters: - name – The alias name.
- id_tag – The identifier tag.
-
class
skidl.skidl.
Bus
(name, *args, **attribs)[source]¶ This class collects one or more nets into a group that can be indexed.
Parameters: - name – A string with the name of the bus.
- args – A list of ints, pins, nets, buses to attach to the net.
Keyword Arguments: attribs – A dictionary of attributes and values to attach to the Net object.
Example
n = Net() led1 = Part('device', 'LED') b = Bus('B', 8, n, led1['K'])
-
connect
(*pins_nets_buses)[source]¶ Return the bus after connecting one or more nets, pins, or buses.
Parameters: pins_nets_buses – One or more Pin, Net or Bus objects or lists/tuples of them. Returns: The updated bus with the new connections. Notes
You can connect nets or pins to a bus like so:
p = Pin() # Create a pin. n = Net() # Create a net. b = Bus('B', 2) # Create a two-wire bus. b += p,n # Connect pin and net to B[0] and B[1].
-
copy
(num_copies=1, **attribs)[source]¶ Make zero or more copies of this bus.
Parameters: num_copies – Number of copies to make of this bus. Keyword Arguments: attribs – Name/value pairs for setting attributes for the copy. Returns: A list of Bus copies or a Bus if num_copies==1. Raises: Exception if the requested number of copies is a non-integer or negative. Notes
An instance of a bus can be copied just by calling it like so:
b = Bus('A', 8) # Create a bus. b_copy = b(2) # Get two copies of the bus.
You can also use the multiplication operator to make copies:
b = 10 * Bus('A', 8) # Create an array of buses.
-
name
¶ Get, set and delete the name of the bus.
When setting the bus name, if another bus with the same name is found, the name for this bus is adjusted to make it unique.
-
skidl.skidl.
Circuit
¶ alias of
SubCircuit
-
class
skidl.skidl.
Net
(name=None, *pins_nets_buses, **attribs)[source]¶ Lists of connected pins are stored as nets using this class.
Parameters: - name – A string with the name of the net. If None or ‘’, then a unique net name will be assigned.
- *pins_nets_buses – One or more Pin, Net, or Bus objects or lists/tuples of them to be connected to this net.
Keyword Arguments: attribs – A dictionary of attributes and values to attach to the Net object.
-
connect
(*pins_nets_buses)[source]¶ Return the net after connecting other pins, nets, and buses to it.
Parameters: *pins_nets_buses – One or more Pin, Net, or Bus objects or lists/tuples of them to be connected to this net. Returns: The updated net with the new connections. Notes
Connections to nets can also be made using the += operator like so:
atmega = Part('atmel', 'ATMEGA16U2') net = Net() net += atmega[1] # Connects pin 1 of chip to the net.
-
copy
(num_copies=1, **attribs)[source]¶ Make zero or more copies of this net.
Parameters: num_copies – Number of copies to make of this net. Keyword Arguments: attribs – Name/value pairs for setting attributes for the copy. Returns: A list of Net copies or a Net if num_copies==1. Raises: Exception if the requested number of copies is a non-integer or negative. Notes
An instance of a net can be copied just by calling it like so:
n = Net('A') # Create a net. n_copy = n() # Copy the net.
You can also use the multiplication operator to make copies:
n = 10 * Net('A') # Create an array of nets.
-
drive
¶ Get, set and delete the drive strength of this net.
The drive strength cannot be set to a value less than its current value. So as pins are added to a net, the drive strength reflects the maximum drive value of the pins currently on the net.
-
name
¶ Get, set and delete the name of this net.
When setting the net name, if another net with the same name is found, the name for this net is adjusted to make it unique.
-
class
skidl.skidl.
Part
(lib=None, name=None, dest=u'NETLIST', tool=u'kicad', connections=None, part_defn=None, **attribs)[source]¶ A class for storing a definition of a schematic part.
-
ref
¶ String storing the reference of a part within a schematic (e.g., ‘R5’).
-
value
¶ String storing the part value (e.g., ‘3K3’).
-
footprint
¶ String storing the PCB footprint associated with a part (e.g., SOIC-8).
-
pins
¶ List of Pin objects for this part.
Parameters: - lib – Either a SchLib object or a schematic part library file name.
- name – A string with name of the part to find in the library, or to assign to the part defined by the part definition.
- part_defn – A list of strings that define the part (usually read from a schematic library file).
- tool – The format for the library file or part definition (e.g., KICAD).
- dest – String that indicates where the part is destined for (e.g., LIBRARY).
- connections – A dictionary with part pin names/numbers as keys and the names of nets to which they will be connected as values. For example: { ‘IN-‘:’a_in’, ‘IN+’:’GND’, ‘1’:’AMPED_OUTPUT’, ‘14’:’VCC’, ‘7’:’GND’ }
Keyword Arguments: attribs – Name/value pairs for setting attributes for the part. For example, manf_num=’LM4808MP-8’ would create an attribute named ‘manf_num’ for the part and assign it the value ‘LM4808MP-8’.
Raises: - * Exception if the part library and definition are both missing.
- * Exception if an unknown file format is requested.
-
copy
(num_copies=1, dest=u'NETLIST', **attribs)[source]¶ Make zero or more copies of this part while maintaining all pin/net connections.
Parameters: - num_copies – Number of copies to make of this part.
- dest – Indicates where the copy is destined for (e.g., NETLIST).
Keyword Arguments: attribs – Name/value pairs for setting attributes for the copy.
Returns: A list of Part copies or a single Part if num_copies==1.
Raises: Exception if the requested number of copies is a non-integer or negative.
Notes
An instance of a part can be copied just by calling it like so:
res = Part('device','R') # Get a resistor. res_copy = res(value='1K') # Copy the resistor and set resistance value.
You can also use the multiplication operator to make copies:
cap = Part('device', 'C') # Get a capacitor caps = 10 * cap # Make an array with 10 copies of it.
-
foot
¶ Get, set and delete the part footprint.
-
get_pins
(*pin_ids, **criteria)[source]¶ Return list of part pins selected by pin numbers or names.
Parameters: pin_ids – A list of strings containing pin names, numbers, regular expressions, slices, lists or tuples. If empty, then it will select all pins. Keyword Arguments: criteria – Key/value pairs that specify attribute values the pins must have in order to be selected. Returns: A list of pins matching the given IDs and satisfying all the criteria, or just a single Pin object if only a single match was found. Or None if no match was found. Notes
Pins can be selected from a part by using brackets like so:
atmega = Part('atmel', 'ATMEGA16U2') net = Net() atmega[1] += net # Connects pin 1 of chip to the net. net += atmega['.*RESET.*'] # Connects reset pin to the net.
-
make_unit
(label, *pin_ids, **criteria)[source]¶ Create a PartUnit from a set of pins in a Part object.
Parts can be organized into smaller pieces called PartUnits. A PartUnit acts like a Part but contains only a subset of the pins of the Part.
Parameters: - label – The label used to identify the PartUnit.
- pin_ids – A list of strings containing pin names, numbers, regular expressions, slices, lists or tuples.
Keyword Arguments: criteria – Key/value pairs that specify attribute values the pin must have in order to be selected.
Returns: The PartUnit.
-
ref
Get, set and delete the part reference.
When setting the part reference, if another part with the same reference is found, the reference for this part is adjusted to make it unique.
-
value
Get, set and delete the part value.
-
-
class
skidl.skidl.
PartUnit
(part, *pin_ids, **criteria)[source]¶ Create a PartUnit from a set of pins in a Part object.
Parts can be organized into smaller pieces called PartUnits. A PartUnit acts like a Part but contains only a subset of the pins of the Part.
Parameters: - part – This is the parent Part whose pins the PartUnit is built from.
- pin_ids – A list of strings containing pin names, numbers, regular expressions, slices, lists or tuples.
Keyword Arguments: criteria – Key/value pairs that specify attribute values the pin must have in order to be selected.
Examples
This will return unit 1 from a part:
lm358 = Part('linear','lm358') lm358a = PartUnit(lm358, unit=1)
Or you can specify the pins directly:
lm358a = PartUnit(lm358, 1, 2, 3)
-
class
skidl.skidl.
Pin
(**attribs)[source]¶ A class for storing data about pins for a part.
Parameters: attribs – Key/value pairs of attributes to add to the library. -
nets
¶ The electrical nets this pin is connected to (can be >1).
-
part
¶ Link to the Part object this pin belongs to.
-
do_erc
¶ When false, the pin is not checked for ERC violations.
-
connect
(*pins_nets_buses)[source]¶ Return the pin after connecting it to one or more nets or pins.
Parameters: pins_nets_buses – One or more Pin, Net or Bus objects or lists/tuples of them. Returns: The updated pin with the new connections. Notes
You can connect nets or pins to a pin like so:
p = Pin() # Create a pin. n = Net() # Create a net. p += net # Connect the net to the pin.
-
copy
(num_copies=1, **attribs)[source]¶ Return copy or list of copies of a pin including any net connection.
Parameters: num_copies – Number of copies to make of pin. Keyword Arguments: attribs – Name/value pairs for setting attributes for the pin. Notes
An instance of a pin can be copied just by calling it like so:
p = Pin() # Create a pin. p_copy = p() # This is a copy of the pin.
-
net
¶ Return one of the nets the pin is connected to.
-
-
class
skidl.skidl.
SubCircuit
(circuit_func)[source]¶ Class object that holds the entire netlist of parts and nets. This is initialized once when the module is first imported and then all parts and nets are added to its static members.
-
parts
¶ List of all the schematic parts as Part objects.
-
nets
¶ List of all the schematic nets as Net objects.
-
hierarchy
¶ A ‘.’-separated concatenation of the names of nested SubCircuits at the current time it is read.
-
level
¶ The current level in the schematic hierarchy.
-
context
¶ Stack of contexts for each level in the hierarchy.
-
circuit_func
¶ The function that creates a given subcircuit.
-
classmethod
set_pin_conflict_rule
(pin1_func, pin2_func, conflict_level)[source]¶ Set the level of conflict for two types of pins on the same net.
Parameters: - pin1_func – The function of the first pin (e.g., Pin.OUTPUT).
- pin2_func – The function of the second pin (e.g., Pin.TRISTATE).
- conflict_level – Severity of conflict (e.g., cls.OK, cls.WARNING, cls.ERROR).
-
Acknowledgements¶
SKiDL was inspired by two other projects:
- PHDL is a schematic design language that exemplifies the main features I wanted in SKiDL: concise, text-based design entry with support for hierarchy.
- MyHDL showed how to use the features of Python to support a particular application (designing/simulating digital logic systems) while keeping access to a rich software ecosystem.
History¶
0.0.7 (2016-09-11)¶
- Lack of KISYSMOD environment variable no longer causes an exception.
- requirements.txt file now references the requirements from setup.py.
- Changed setup so it generates a pckg_info file with version, author, email.
0.0.6 (2016-09-10)¶
- Fixed error caused when trying to find script name when SKiDL is run in interactive mode.
- Silenced errors/warnings when loading KiCad part description (.dcm) files.
0.0.5 (2016-09-07)¶
- SKiDL now searches for parts with a user-configurable list of library search paths.
- Part descriptions and keywords are now loaded from the .dcm file associated with a .lib file.
0.0.4 (2016-08-27)¶
- SKiDL scripts can now output netlists in XML format.
0.0.3 (2016-08-25)¶
- Added command-line utility to convert netlists into SKiDL programs.
0.0.2 (2016-08-17)¶
- Changed the link to the documentation.
0.0.1 (2016-08-16)¶
- First release on PyPI.