Clockwork Python

pyGForce - Force Directed Graphs in Python with NetWorkX and pyGTK

2012-02-17T12:39:00.000-08:00

The latest little piece of handiwork that I would like to present is...

PyGForce - a force-directed graphing library that leverages current python technologies
- NetworkX python graph theory library
- python wrapper for GTK, pyGTK.

PyGForce is available under GIT source control from the GitHub
via HTTP - https://github.com/davidbarkhuizen/pygforce.git
via Anonymous GIT - git://github.com/davidbarkhuizen/pygforce.git

Basic Force-Directed Graph

And with Node Labelling

End.

Aggregated APDU List

2012-01-28T02:06:00.000-08:00

Cheef's Grand APDU ListSmartcard Selected InformationAPDU list

#------------+------------------------+------------------------+----------------------+--------------------------------+
|ClaIns P1 P2|Lc Send Data            |Le  Recv Data           | Specification        | Description                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    04                                                        | ISO 7816-9 6.3       | DEACTIVATE FILE                |
| A0 04 00 00 00                                               | 3GPP TS 11.11        | INVALIDATE                     |
| A0 04 00 00 00                                               | SAGEM SCT U34 6.15   | INVALIDATE                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 0D xx xx 08 xxxx xxxx xxxx xxxx                           | SAGEM SCT U34        | VERIFY TRANSPORT CODE          |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    0C                                                        | ISO 7816-4 7.3.6     | ERASE RECORD (S)               |
| 80 0C 00 xx                          xx                      | SAGEM SCT U34 8.1.2  | CHECK (flash)                  |
| 80 0C 01 xx                          xx                      | SAGEM SCT U34 8.1.2  | CHECK (EEPROM)                 |
| 80 0C 02 xx                          xx                      | SAGEM SCT U34 8.1.2  | CHECK (checksum of file)       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    0E                                                        | ISO 7816-4 8.2.4     | ERASE BINARY                   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    10                                                        | ISO 7816-7           | PERFORM SCQL OPERATION         |
| 00 10 00 80 xx table name, ...                               | ISO 7816-7 7.1       | CREATE TABLE                   |
| 00 10 00 81 xx view name, table name                         | ISO 7816-7 7.2       | CREATE VIEW                    |
| 00 10 00 82 xx dictionary name                               | ISO 7816-7 7.3       | CREATE DICTIONARY              |
| 00 10 00 83 xx table name                                    | ISO 7816-7 7.4       | DROP TABLE                     |
| 00 10 00 84 xx view or dictionary                            | ISO 7816-7 7.5       | DROP VIEW                      |
| 00 10 00 85 xx privileges                                    | ISO 7816-7 7.6       | GRANT                          |
| 00 10 00 86 xx privileges                                    | ISO 7816-7 7.7       | REVOKE                         |
| 00 10 00 87 xx data                                          | ISO 7816-7 7.8       | DECLARE CURSOR                 |
| 00 10 00 88                                                  | ISO 7816-7 7.9       | OPEN                           |
| 00 10 00 89                                                  | ISO 7816-7 7.10      | NEXT                           |
| 00 10 00 8A                          xx D, fixing N (columns)| ISO 7816-7 7.11      | FETCH                          |
| 00 10 00 8B                          xx D, fixing N (columns)| ISO 7816-7 7.12      | FETCH NEXT                     |
| 00 10 00 8C xx data                                          | ISO 7816-7 7.13      | INSERT                         |
| 00 10 00 8D xx data                                          | ISO 7816-7 7.14      | UPDATE                         |
| 00 10 00 8E                                                  | ISO 7816-7 7.15      | DELETE                         |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    12                                                        | ISO 7816-7           | PERFORM TRANSACTION OPERATION  |
| 00 12 00 80                                                  | ISO 7816-7 8.2.1     | BEGIN                          |
| 00 12 00 81                                                  | ISO 7816-7 8.2.2     | COMMIT                         |
| 00 12 00 82                                                  | ISO 7816-7 8.2.3     | ROLLBACK                       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    14                                                        | ISO 7816-7           | PERFORM USER OPERATION         |
| 00 14 00 80 xx User ID, ...                                  | ISO 7816-7 9.2.1     | PRESENT USER                   |
| 00 14 00 81 xx User ID, profile, ...                         | ISO 7816-7 9.2.2     | CREATE USER                    |
| 00 14 00 82 xx User ID                                       | ISO 7816-7 9.2.3     | DELETE USER                    |
| 80 14 xx xx 00                                               | GEMPLUS MPCOS-EMV    | Switch Protocol                |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 84 16 00 00 xx MAC                                           | VSDC                 | CARD BLOCK                     |
| 80 16 0X 00 05 xxxx xxxx xx                                  | GEMPLUS MPCOS-EMV    | Freeze Access Conditions       |
| 84 16 0X 00 08 xxxx xxxx xxxx xxxx                           | GEMPLUS MPCOS-EMV    | Freeze Access Conditions       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 84 18 00 00 xx MAC                                           | VSDC                 | APPLICATION UNBLOCK            |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 84 1E 00 00 xx MAC                                           | VSDC                 | APPLICATION BLOCK              |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    20                                                        | ISO 7816-4 8.5.5     | VERIFY                         |
| 00 20 00 80 08 xxxx xxxx xxxx xxxx                           | VSDC                 | VERIFY (Transaction PIN data)  |
| A0 20 00 xx 08 CHV Value                                     | 3GPP TS 11.11        | VERIFY                         |
| A0 20 00 xx 08 CHV Value                                     | SAGEM SCT U34 6.10   | VERIFY                         |
| 80 20 00 xx 08 ADM Value                                     | SAGEM SCT U34 8.1.4  | VERIFY ADM                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 21 00 xx 08 ADM Value                                     | SAGEM SCT U34 8.1.4  | VERIFY ADM                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    22                                                        | ISO 7816-4 8.5.10    | MANAGE SECURITY ENVIRONMENT    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    24                                                        | ISO 7816-4 8.5.6     | CHANGE CHV                     |
| 84 24 00 00 xx PIN data + MAC                                | VSDC                 | PIN CHANGE/UNBLOCK             |
| A0 24 00 xx 10 Old CHV, New CHV                              | 3GPP TS 11.11        | CHANGE CHV                     |
| A0 24 00 xx 10 Old CHV, New CHV                              | SAGEM SCT U34 6.11   | CHANGE CHV                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    26                                                        | ISO 7816-4 8.5.8     | DISABLE CHV1                   |
| A0 26 00 01 08 CHV1 value                                    | 3GPP TS 11.11        | DISABLE CHV1                   |
| A0 26 00 01 08 CHV1 value                                    | SAGEM SCT U32 6.12   | DISABLE CHV1                   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    28                                                        | ISO 7816-4 8.5.7     | ENABLE CHV1                    |
| A0 28 00 01 08 CHV1 value                                    | 3GPP TS 11.11        | ENABLE CHV1                    |
| A0 28 00 01 08 CHV1 value                                    | SAGEM SCT U34 6.13   | ENABLE CHV1                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    2A                                                        | ISO 7816-8 5.2       | PERFORM SECURITY OPERATION     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    2C                                                        | ISO 7816-4 8.5.9     | UNBLOCK CHV                    |
| A0 2C 00 xx 10 Unblock CHV(PUK), New CHV                     | 3GPP TS 11.11        | UNBLOCK CHV                    |
| A0 2C 00 xx 10 Unblock CHV(PUK), New CHV                     | SAGEM SCT U34 6.14   | UNBLOCK CHV                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| A0 2E 00 0# 01 Data                                          | 3GPP TS 11.11        | WRITE CODE STATUS              |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| A0 32 00 00 03 Value to be added.                            | 3GPP TS 11.11        | INCREASE                       |
| A0 32 00 00 03 Value to be added.                            | SAGEM SCT U34 6.9    | INCREASE                       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    39                                                        |                      | java Authentificate User Comman|
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    44                                                        | ISO 7816-9 6.4       | ACTIVATE FILE                  |
| A0 44 00 00 00                                               | 3GPP TS 11.11        | REHABILIDATE                   |
| A0 44 00 00 00                                               | SAGEM SCT U34 6.16   | REHABILIDATE                   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    46                                                        | ISO 7816-8 5.1       | GENERATE ASYMMETRIC KEY PAIR   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 50 xx xx 08 Host challenge        00                      | GlobalPlatform       | INITIALIZE UPDATE then [C0]    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    70                                                        | ISO 7816-4 8.1.2     | MANAGE CHANNEL                 |
| 00 70 xx xx                          xx                      | GlobalPlatform       | MANAGE CHANNEL                 |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 78 00 03 xx                                               | GlobalPlatform       | END R-MAC SESSION              |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 7A xx 01 xx Data and C-MAC, if needed                     | GlobalPlatform       | BEGIN R-MAC SESSION            |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    82                                                        | ISO 7816-4 8.5.3     | EXTERNAL AUTHENTICATE          |
| 84 82 00 00 10 Host cryptogram and MAC                       | GlobalPlatform       | EXTERNAL AUTHENTICATE          |
| 84 82 00 00 0A Authentication-related data                   | VSDC                 | EXTERNAL AUTHENTICATE          |
| 00 82 00 xx 06 Manual                                        | GEMPLUS MPCOS-EMV    | EXTERNAL AUTHENTICATE          |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    84                                                        | ISO 7816-4 8.5.2     | GET CHALLENGE                  |
| 00 84 00 00                          08 Rnd Num              | VSDC                 | GET CHALLENGE                  |
| 00 84 xx xx                          08 Rnd Num              | GEMPLUS MPCOS-EMV    | GET CHALLENGE                  |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    86                                                        | ISO 7816-4 8.5.4     | GENERAL AUTHENTICATE           |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    88                                                        | ISO 7816-4 8.5.1     | INTERNAL AUTHENTICATE          |
| 00 88 XX xx 0A Manual                                        | GEMPLUS MPCOS-EMV    | INTERNAL AUTHENTICATE          |
| A0 88 00 00 10 RAND : Rnd num        xx  SRES( 4B) , Kc (8B) | 3GPP TS 11.11        | RUN GSM ALGORITHM              |
| A0 88 00 00 10 RAND : Rnd num        xx  SRES( 4B) , Kc (8B) | SAGEM SCT U34 6.17   | RUN GSM ALGORITHM              |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    A0                                                        | ISO 7816-4 8.2.5     | SEARCH BINARY                  |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    A2                                                        | ISO 7816-4 8.3.5     | SEEK                           |
| A0 A2 00 xx xx Pattern               xx                      | 3GPP TS 11.11        | SEEK                           |
| A0 A2 00 xx xx Pattern               xx                      | SAGEM SCT U34 6.8    | SEEK                           |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    A4                                                        | ISO 7816-4 8.1.1     | SELECT                         |
| 00 A4 04 00 xx AID                   00                      | GlobalPlatform       | SELECT                         |
| 00 A4 00 xx xx File ID || Name       00  Manual              | VSDC                 | SELECT                         |
| A0 A4 00 00 02 File ID                                       | 3GPP TS 11.11        | SELECT                         |
| A0 A4 00 00 02 File ID                                       | SAGEM SCT U34 6.1    | SELECT                         |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 A8 00 00 00                       00                      | VSDC                 | GET PROCESSING OPTIONS         |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 AE 00 xx Transaction-related data                         | VSDC                 |                                |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    B0                                                        | ISO 7816-4 8.2.1     | READ BINARY                    |
| 00 B0 xx xx                          xx                      | GEMPLUS MPCOS-EMV    | READ BINARY                    |
| A0 B0 xx xx                          xx                      | 3GPP TS 11.11        | READ BINARY                    |
| A0 B0 xx xx                          xx                      | SAGEM SCT U34 6.4    | READ BINARY                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    B2                                                        | ISO 7816-4 8.3.1     | READ RECORD                    |
| 00 B2 xx                             00                      | VSDC                 | READ RECORD                    |
| A0 B2 xx xx                          xx                      | 3GPP TS 11.11        | READ RECORD                    |
| A0 B2 xx xx                          xx                      | SAGEM SCT U34 6.6    | READ RECORD                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    B4                                                        |                      | java Component Data            |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    B8                                                        |                      | java Create Applet             |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    BA                                                        |                      | java CAP end                   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    BC                                                        |                      | java Component end             |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    BE                                04 Data                 | GEMPLUS GemClub-MEMO | READ                           |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    C0                                                        | ISO 7816-4 8.6.1     | GET RESPONSE                   |
| 00 C0                                1C Key Info             | GlobalPlatform       | GET RESPONSE                   |
| 00 C0 00 00                          00                      | VSDC                 | GET RESPONSE                   |
| 80 C0 00 00                          xx                      | GEMPLUS MPCOS-EMV    | Get Info on Get Response       |
| 80 C0 02 A0                          08 Chip SN              | GEMPLUS MPCOS-EMV    | Get Info                       |
| 80 C0 02 A1                          08 Card SN              | GEMPLUS MPCOS-EMV    | Get Info                       |
| 80 C0 02 A2                          08 Issuer SN            | GEMPLUS MPCOS-EMV    | Get Info                       |
| 80 C0 02 A3                          04 Iss.Ref.N            | GEMPLUS MPCOS-EMV    | Get Info                       |
| 80 C0 02 A4                          0D Chip Inf             | GEMPLUS MPCOS-EMV    | Get Info                       |
| 80 C0 02 A5                          xx Keys                 | GEMPLUS MPCOS-EMV    | Get Info                       |
| 80 C0 02 A6                          02 Last DF/EF           | GEMPLUS MPCOS-EMV    | Get Info                       |
| A0 C0 00 00                          xx                      | 3GPP TS 11.11        | GET RESPONSE                   |
| A0 C0 00 00                          xx                      | SAGEM SCT U34 6.3    | GET RESPONSE                   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    C2                                                        | ISO 7816-4 8.6.2     | ENVELOPE                       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    C4                                                        |                      | java Delete Applets            |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    CA                                                        | ISO 7816-4 8.4.1     | GET DATA                       |
| 00 CA 00 xx xx MAC, if present                               | GlobalPlatform       | GET DATA                       |
| 80 CA xx xx xx                                               | VSDC                 | GET DATA                       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    D0                                                        | ISO 7816-4 8.2.2     | WRITE BINARY                   |
| 80 D0 xx xx xx Data to be written in EEPROM                  | VSDC                 | LOAD STRUCTURE                 |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    D2                                                        | ISO 7816-4 8.3.2     | WRITE RECORD                   |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    D6                                                        | ISO 7816-4 8.2.3     | UPDATE BINARY                  |
| A0 D6 xx xx xx Data to be written in EEPROM                  | 3GPP TS 11.11        | UPDATE BINARY                  |
| A0 D6 xx xx xx Data to be written in EEPROM                  | SAGEM SCT U34 6.5    | UPDATE BINARY                  |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 D8 xx xx xx KEY Date (and MAC)    00                      | GlobalPlatform       | PUT KEY                        |
|    D8                                                        | EMV                  | Set Card Status(personalization|
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    DA                                                        | ISO 7816-4 8.4.2     | PUT DATA                       |
| 00 DA xx xx xx Data                                          | VSDC                 | PUT DATA                       |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    DC                                                        | ISO 7816-4           | UPDATE RECORD                  |
| 00 DC xx xx xx Data (and MAC)                                | VSDC                 | UPDATE RECORD                  |
| A0 DC xx xx xx Data to be written in EEPROM                  | 3GPP TS 11.11        | UPDATE RECORD                  |
| A0 DC xx xx xx Data to be written in EEPROM                  | SAGEM SCT U34 6.7    | UPDATE RECORD                  |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    DE       04 Data                                          | GEMPLUS GemClub-MEMO | UPDATE                         |
| A0 DE 00 00 03 Data                                          | 3GPP TS 11.11        | LOAD AoC(SICAP)                |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    E0                                                        | ISO 7816-9 6.1       | CREATE FILE                    |
| 80 E0 02 00 0C Manual                                        | GEMPLUS MPCOS-EMV    | CREATE FILE                    |
| 80 E0 xx xx xx FCI length                                    | 3GPP TS 11.11        | CREATE FILE                    |
| 80 E0 xx xx xx FCI length                                    | SAGEM SCT U34        | CREATE FILE                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    E2                                                        | ISO 7816-4 8.3.4     | APPEND RECORD                  |
| 80 E2 00 00 xx Record (and MAC)                              | GlobalPlatform       | APPEND RECORD                  |
| 00 E2 00 00 xx Record                                        | VSDC                 | APPEND RECORD                  |
| 00 E2 00 00 xx Record                                        | GEMPLUS MPCOS-EMV    | APPEND RECORD                  |
| 00 E2 00 00 xx Record                                        | 3GPP TS 11.11        | APPEND RECORD                  |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    E4                                                        | ISO 7816-9 6.2       | DELETE FILE                    |
| 80 E4 00 00 xx TLV coded name                                | GlobalPlatform       | DELETE FILE                    |
| A0 E4 00 00 02 xx xx                                         | 3GPP TS 11.11        | DELETE FILE                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    E6                                                        | ISO 7816-9 6.5       | TERMINATE DF                   |
| 80 E6 xx 00 xx Manual                                        | GlobalPlatform       | INSTALL                        |
| A0 E6 xx xx 00                                               | 3GPP TS 11.11        | LOCK RECORD                    |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    E8                                                        | ISO 7816-9 6.6       | TERMINATE EF                   |
| 80 E8 00 00 xx Record                                        | GlobalPlatform       | LOAD                           |
| A0 E8 00 xx 10 Data                                          | 3GPP TS 11.11        | READ DIRECTORY                 |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 EA 00 00 xx Data                                          | 3GPP TS 11.11        | CREATE BINARY                  |
| 80 EA 00 00 xx Data                                          | SAGEM SCT U34        | CREATE BINARY                  |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 EE 00 xx 00                                               | VSDC                 | WRITE LOCK                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 F0 xx xx xx AID of Application (and MAC)                  | GlobalPlatform       | SET STATUS                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| A0 F2 00 00 xx                                               | 3GPP TS 11.11        | GET STATUS                     |
| A0 F2 00 00 xx                                               | SAGEM SCT U34 6.2    | GET STATUS                     |
| 80 F2 xx xx                                                  | GlobalPlatform       | GET STATUS                     |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 F8 xx xx                          xx                      | SAGEM SCT U34 8.1.1  | DIR                            |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| A0 FA 00 00 00                                               | 3GPP TS 11.11        | SLEEP                          |
| A0 FA 00 00 00                                               | SAGEM SCT U34 6.18   | SLEEP                          |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 FB xx xx                          xx                      | SAGEM SCT U34 8.1.1  | DIR                            |
+------------+------------------------+------------------------+----------------------+--------------------------------+
| 80 FC xx xx                          10                      | SAGEM SCT U34 8.1.3  | READ INFO                      |
+------------+------------------------+------------------------+----------------------+--------------------------------+
|    FE                                                        | ISO 7816-9 6.7       | TERMINATE CARD USAGE           |
| 80 FE xx xx 00                                               | SAGEM SCT U34        | BLOW FUSE                      |
+------------+------------------------+------------------------+----------------------+--------------------------------+

Dynamite Knight's Tour in F# - Tom Wells

2012-01-10T11:06:00.000-08:00

An Ungodly Fast Solution in F# to the Knights Tour

I would suggest that you consider coding the solution up in F#, as my friend Tom Wells has done. His solution finds all solutions for the 5x5 board in under 5 minutes.

let boardsize = 7

// Setup board in 2d array setting all elements to true
//  ___________________
// |0,4|1,4|2,4|3,4|4,4| (x,y)
// |0,3|1,3|2,3|3,3|4,3|
// |0,2|1,2|2,2|3,2|4,2|
// |0,1|1,1|2,1|3,1|4,1|
// |0,0|1,0|2,0|3,0|4,0|
//  -------------------
//
let referenceboard = Array2D.init boardsize boardsize (fun x y -> true)

let legalmoves x y =
    // Generate every move (impossible or not)
    //
    let possibles = [(x - 1, y - 2); (x - 2, y - 1);
                     (x + 1, y - 2); (x + 2, y - 1);
                     (x + 1, y + 2); (x + 2, y + 1);
                     (x - 1, y + 2); (x - 2, y + 1);]
    
    // Prune the ones falling outside of the board
    //
    possibles |> List.filter (fun (x, y) -> x >= 0 && y >= 0 && x < boardsize && y < boardsize)

// Is a particular move still available to us? ie not already used
//
let availablemove x y (board : bool[,]) =
    board.[x,y] = true

let rec hunt startx starty (board : bool[,]) (history : List<(int*int)>) foundsolutionfunc = 
    // Mark the position we're at as being taken
    //
    board.[startx,starty] <- false

    // Check if we have a solution (ie we've covered the entire board)
    //
    if history.Length = boardsize * boardsize then
        foundsolutionfunc (history) |> ignore
    else
        // Calculate the set of available moves from this point, filtering by positions which we've already used
        //
        let availablemoves = legalmoves startx starty |> List.filter (fun (x,y) -> availablemove x y board)

        // For each available move, recurse
        //
        for (x,y) in availablemoves do
            hunt x y (Array2D.copy board) ((x,y) :: history) foundsolutionfunc

[<EntryPoint>]
let main args =
    
    let starttime = System.DateTime.Now

    let solutions = new System.Collections.Generic.List<System.Tuple<int,int>>()
    for x in seq { 0 .. Array2D.length1 referenceboard - 1 } do
        for y in seq { 0 .. Array2D.length2 referenceboard - 1 } do
            printf "(%d,%d)" x y

            hunt x y (Array2D.copy referenceboard) [(x,y)] (fun solution ->
                solutions.Add(new System.Tuple<int,int>(x,y))
                printf "."
            )    

    let endtime = System.DateTime.Now

    printfn "\nFound %d solutions (took %03f seconds)" solutions.Count (endtime - starttime).TotalSeconds
    
    printfn "Enter to quit"
    System.Console.In.ReadLine() |> ignore

    0

EMV / Smart-Card Development with pyscard

2012-01-06T00:14:00.000-08:00

EMV Resources
- EMV Entry on Wikipedia

ATR = Answer To Reset
Standard/Spec = ISO7816-3
OnLine ATR Byte String Parser
ATR @ Wikipedia

PySCard Resources
- Project @ SourceForge

pyscard on ubuntu
1. install pcscd : sudo apt-get install pcscd
2. start daemon : sudo /etc/init.d/pcscd start

PY_EMV_UTILS - python pyscard emv smartcard utilities
svn checkout svn://svn.code.sf.net/p/pyemvutils/code/trunk pyemvutils-code

The Knights Tour Problem - Multi-Processor Algorithmic Parallelism with Python

2012-01-02T02:27:00.000-08:00

Resources
- Wikipedia Entry.
- Stefan Behnel's page [What the Chess Knight is Doing] features some handy info on the solution space.

A Brief Introduction to the Knight's Tour Problem

A Knight's Tour is a traversal of an 8x8 chess-board by the Knight / Horse piece, where the Knight touches each and every square once and only once during the tour, and makes only its characteristic L-shaped legal moves.

Open Knights Tour on 5x5 Board
[Graphic Linked from Wikipedia Entry]

The problem can be further generalised by varying board parameters - to produce arbitrarily sized square NxN grids, and also arbitrarily-sized rectangular NxM grids.

There is also the closely-related problem of finding closed tours - where the Knight must be in a position on the final square of its open tour to theoretically return again to the first square of that tour by a legal move [closing the tour].

Closed Knights Tour on 8x8 Board
[Graphic Linked from Wikipedia Entry]

The Knights Tour Problem is a specific instance of the more general problem of finding a Hamiltonian Path (i.e. a connected path that touches each vertex once and only once) [open tour problem], and a finding a Hamiltonian cycle [closed tour problem].

The Solution Space

NxN Square Board - Open Tours

4x4 => 0
5x5 => 1728
6x6 =>
7x7 => 6,637,920
8x8 => 8,121,130,233,753,702,400

Brute Force Solution Approach

A brute force approach is typically only practical in the case of the 5x5 board, and is not generally useful for the higher dimensional problems, due to the fact the the solution space explodes with increasing problem dimensions. From the Wikipedia entry: "For a regular 8x8 chess board, there are approximately 4×10^51 possible move sequences, and it would take an unfathomable amount of time to iterate through such a large number of moves."

So, in the case of 8x8, there are 4x10^51 possible move sequences, and 8.1x10^18 solutions, therefore for every solution, there are approximately 4.9x10^32 move sequences, a vanishingly small ratio...

A Useful Heuristic - Warnsdorff's Rule [Wikipedia]

Warnsdorff's rule is a heuristic method for finding a knight's tour. Briefly, one moves the knight according to the following rule: always proceed to the square from which the knight will have the fewest onward moves. It is, of course, possible to have two or more choices for which the number of onward moves is equal; there are various methods for breaking such ties, including one devised by Pohl and another by Squirrel and Cull. This rule may also more generally be applied to any graph. In graph-theoretic terms, each move is made to the adjacent vertex with the least degree. Although the Hamiltonian path problem is NP-hard in general, on many graphs that occur in practice this heuristic is able to successfully locate a solution in linear time. The knight's tour is a special case. The heuristic was first described in "Des Rösselsprungs einfachste und allgemeinste Lösung" by H. C. von Warnsdorff in 1823.

Brute-Force / Depth First Search

Finding of All Open Tours

in 5 x 5 Case

Solution Description

A back-tracker / depth-first searcher was developed in Python 2.7.

A Definition of Back-Tracking from the Wikipedia:

Backtracking is a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c cannot possibly be completed to a valid solution.

A Definition of State Space Search from the Wikipedia:

State space search is a process used in the field of computer science, including artificial intelligence (AI), in which successive configurations or states of an instance are considered, with the goal of finding a goal state with a desired property.

Problems are often modelled as a state space, a set of states that a problem can be in. The set of states forms a graph where two states are connected if there is an operation that can be performed to transform the first state into the second.

State space search often differs from traditional computer science search methods because the state space is implicit: the typical state space graph is much too large to generate and store in memory. Instead, nodes are generated as they are explored, and typically discarded thereafter. A solution to a combinatorial search instance may consist of the goal state itself, or of a path from some initial state to the goal state.

A General Description of the Specific Back-Tracker Implementation

Essentially the tracker successively explores the state space, collecting solutions as it goes.

Considering the 5x5 grid case, and starting from a blank board:

It is first noted that there are 25 possible first moves than can be made, since the knight can be placed on any of the 5 x 5 = 25 squares.

From each of these 25 possible first moves, uniquely different (although sometimes symmetrical) second moves can be made. Now, the number of possible second moves is not the same for every possible first move, for example first moves to edge squares will have less possible second moves than first moves to the centre square (or centre squares, in the case of even-dimensioned square boards).

Then for each of the possible second moves, there are a number of possible third moves, and so on, until either the knight gets stuck or successfully untangles a Hamiltonian path.

Thus the solution space can be thought of as a tree structure, with the blank board as the root node, and each of the 25 possible first choices as nodes adjacent to the root node. Each of the possible second choices are then nodes adjacent to their respective first-choice nodes, and so on. Knight's tours will then be Hamiltonian paths of length 25 [= N^2 = NxN], and aborted attempts will correspond to shorter paths.

The back-tracker dynamically and successively generates this tree structure - exploring a particular branch, until a dead-end is reached, then back-tracking until the first unexplored branch is encountered, pruning the fully examined branch off the tree and discarding it to minimize persistence (memory/disc) utilisation, before continuing forward again to explore another remaining unexamined branch.

Parallelisation with Python's Multiprocessing Module

The Knights tour problem just screams parallelisation, but how to do this given the restrictions imposed by Python's crummy Global Interpreter Lock (GIL) on the language's support for true multi-threading ? With the standard library's multiprocessing module:

multiprocessing is a package that supports spawning processes using an API similar to the threading module. The multiprocessing package offers both local and remote concurrency, effectively side-stepping the Global Interpreter Lock by using subprocesses instead of threads. Due to this, the multiprocessing module allows the programmer to fully leverage multiple processors on a given machine. It runs on both Unix and Windows.

So, what multiprocessing actually gives you is a set of independent operating-system level processes, each with it's own Python VM, and some infrastructure for both passing objects and (save us) directly sharing memory between these distinct processes.

Design Pattern

The design I've chosen utilises a single co-ordinating process, which spawns agent processes that are responsible for the execution of the actual business of exploring the solution space.

In the simplest case each agent process is assigned a different first choice, and it generates, examines and prunes the branch associated with that specific first choice, communicating solutions found back to the co-ordinating process, and finally notifying it of completion (total exploration of assigned solution space).

When the co-ordinating process is informed of successfully termination of an agent process, it will then spawn a new agent and assign them to examine a different branch of the tree.

When all branches have been examined, the solution space can be considered exhausted and all solutions found, and the coordinating process will report to file, and terminate.

Communication between the coordinating processes and its agents is achieved via use of the duplex pipe object available in the multiprocessing module.

Test

The Test
Exhaustively searching for and identifying all 1728 Knight's Tours on the 5x5 board.

Test Machine
I5-4x2.3GHz-8MB = Intel i5-2410M 2.3GHz with 8 GB
Test Machine Syn features an Intel i5 array of 4 cores at 2.3 GHz, with 8 GB memory available, running 64bit Windows 7, and 32 bit Python 2.7.

The Results

Single Process, No Threading - Effectively 1 Core

First off, the performance of the basic unthreaded, singleton-process back-tracker.

Total Time = 1hr46mins = 106 mins = 6360 seconds
Total Solution Count = 1728
Average Rate of Solution Finding = 0.27 solutions per second
Average Time to Find Next Solution = 3.68 seconds per solution

1 Controller Core + 3 x Agent Cores

Total Time = 41 mins = 2460 seconds
Total Solution Count = 1728
Average Rate of Solution Finding = 0.70 solutions per second
Average Time to Find Next Solution = 1.42 seconds per solution

Comparison - Singleton Process versus Multi-Process [1 Controller, 3 Agents]

So, the question is, from a quantitative perspective, what gains have been achieved by parallelising the algorithm ?

Since the test machine has 4 cores available, and the algorithm uses one of them for co-ordination, and farms out the work to 3 agent processes, we expect to see about a 3-fold gain in speed / decrease in total time.

Actually Observed Performance Ratio = 6360 / 2460 ~ 2.59
Theoretical Maximum Performance Ratio = 3 [going from 1 to 3 worker cores]

So, overall our increase in performance is not too bad, we didn't quite achieve the maximum ratio of 3, but we're not too far off at 2.59. Quantitatively we have achieved ~ 86% of the maximum theoretically possible increase in performance.

POST SCRIPT

"So, overall our increase in performance is not too bad" - Unfortunately, this is a blatant lie, see the next post on this topic for damning details.

Python IDEs/Editors

2011-12-31T08:56:00.000-08:00

If you're getting into developing in python, then you're going to ask yourself the question 'Which IDE / code editor should I use?' Although this is obviously a subjective issue, let me weigh in with my personal experience.

[StackOverFlow.com - What IDE to use for Python ?]

Ignoring VI/Emacs.

Note Pad Plus Plus

If you're a MicroSerf / Windows developer, then one good option is NotePadPlusPlus (NPPP). NPPP is light-weight - and so snappy and responsive, but at the same time VERY extensively featured. On the downside, it's really a Windows-only product, and so if you like me want to be able to use the same python dev platform across both Windows and Linux, then NPPP is disqualified. Other detractors are a lack of code completion, and no class / solution explorer. (At least no built-in code completion, and the one or two attempts I made to equip it with a plug-in failed.)

Geany

Which brings us to Scintilla-derivative Geany, a long-time personal favourite of mine. It's a light-weight code editor which bests NPPP by coming off-the-shelf with some code completion, and a class/solution explorer. OS-wise, Geany binaries compiled for both Linux and Windows are available. On the down-side, the feature-set that Geany offers is quite limited compared to NPPP, although most of the essentials are there. The upside of the limited feature set, is that the IDE/editor itself is not resource hungry.

Eclipse PyDev

Finally, the PyDev extension for Eclipse. I've just recently started using this, so its a bit early in the game for comment, but it's obviously a fully featured IDE, with code completion, a solution/class explorer, test-infrastructure integration, cross-platform and is open-source. The only disadvantage of this option is that Eclipse is clearly not a light-weight application itself, and so if your development box is spec-light, then you may want to go with either NotePadPlusPlus or Geany.

Note Pad Plus Plus
+ V.Fast, light-weight
- Windows only (Linux version runs under Windows emulator [Wine], and is horrible)

Geany
+ Cross OS - identical Windows & Linux versions
+ Code completion
+ Class / solution explorer
+ Light-weight
- Relatively limited feature-set

Eclipse PyDev
+ Cross OS - identical Windows & Linux versions
+ Code-completion
+ Refactoring support
+ Class / solution explorer
+ Test integration
+ Integrated debug support
- Requires decent machine specs

Post Script - Aptana Studio 3

In the two months or so since I wrote this post up, I've started using Aptana Studio 3.

Aptana Studio 3is a customisation of Eclipse developed and maintained by Aptana, who via some convoluted corporate cannibalism, has absorbed the original PyDev team. So, in short, Aptana is the heir apparent to PyDev for Eclipse.

What you get is an all-in-one download, which short-circuits the previous two-stage download, for a grade-A user-experience. The IDE itself is snappy, and seems faster than PyDev under Eclipse Indigo. In addition, Aptana features support for Django projects, although I haven't actually done any Django work in the interim, so more to come on that...

FINAL VERDICT

Aptana Studio 3 by a Knock-Out !

Sieve of Eratosthenes in F# - Attempt # 1

2011-12-07T00:39:00.001-08:00

sieve.fs :


namespace sieve
  module sieve = 

(*
A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself.
To find all the prime numbers less than or equal to a given integer n by Eratosthenes' method:
*)

    let shake (n : int) = 

      printfn "Applying Sieve of Eratosthenes to First %i Natural Numbers" n |> ignore
      
      // 1. Create a list of consecutive integers from 2 to n: (2, 3, 4, ..., n).
      let matrix = Array.init n (fun x -> true)

      // 2. Initially, let p equal 2, the first prime number.
      let mutable p = 2

      let mutable set_exhausted = false
      while (set_exhausted = false) do
      
        //  3. Starting from p, count up in increments of p and mark each of these numbers greater than p itself in the list.
        //  These numbers will be 2p, 3p, 4p, etc.; note that some of them may have already been marked.        
        let mutable i = p + p
        while (i <= n) do        
          matrix.[i - 1] <- false
          i <- i + p

        //  4. Find the first number greater than p in the list that is not marked; let p now equal this number (which is the next prime).        
        p <- p + 1
        while ((p <= n - 1) && (matrix.[p - 1] <> true)) do
          p <- p + 1      
        
        //  5. If there were no more unmarked numbers in the list, stop. Otherwise, repeat from step 3.
        if (p >= n - 1) then
          set_exhausted <- true

      //  6. When the algorithm terminates, all the numbers in the list that are not marked are prime.
      matrix

Program.fs :


namespace effsharp
module Main =
    open System
    open sieve
        []
        let main args =         
            
            printfn "Sieve up to what natural number ? [Max %i]" Int32.MaxValue
            let nStr = Console.ReadLine()
            let n = Int32.Parse(nStr)

            let primes = sieve.shake n

            for i = 1 to n do              
              if (primes.[i - 1] = true) then
                printfn "%i" i |> ignore

            printfn "any key to exit..."
            let endofapp = Console.ReadKey()
            0

Sharpening the Eff - an Intro to F#

2011-12-06T05:42:00.001-08:00

F#.NET
Functional
Typing = implicit, static, strict
CLR-based

Coding Conventions
MSDN Draft F# Component Design Guidelines

Getting Started
High-level application structure, Modules & Namespaces
MSDN EntryPoint Note
Functions vs Values - WikiBooks Entry

Functions
Intro to Functions in F#
When is a Function Executed ?
Why use a Backward Pipe Operator ( <| ) instead of Function Chaining?
lazy - Lazy Evaluation

Arrays

initialization: myIntArray = [|1;2;3;4|]

accessing: let firstElementOfMyArray = myIntArray.[0]

array1.[0]

Arrays in F# - Marius Bancila’s Blog
StackOverflow - Initializing Arrays in F#

Looping
MSDN for...in

MSDN for...to
for i = 1 to n do

Classes
Object Oriented F# – Creating Classes [CodeBetter.com]

Interfaces
Bug squash - Implementing interfaces in F#
Why F# interface differs greatly from C#
The basic syntax of F# – classes, interfaces, and members

Reference in the manifest does not match the identity of the downloaded assembly

2011-09-09T00:24:00.000-07:00

The following problem may be encountered when attempting an IIS web install/deploy of a 1-Click Install produced by using the Publish option under Visual Studio 2010.

Reference in the manifest does not match the identity of the downloaded assembly

To fix, right-click on the project and goto
Properties > Application > Resources > Icon and Manifest > Manifest
and select the 'Create application without a manifest' option.

[StackOverFlow.com]

Reclaim/Move a Lost/Off-Screen Window in Windows 7

2011-09-01T02:18:00.000-07:00

METHOD 1
1. Alt-tab to lost window
2. Right-click on icon for lost window in the task-bar - You may have to first hover over the icon (if it's pinned)
3. Select 'Move' from the drop-down menu
4. Hit any arrow key
5. Move mouse to re-position

METHOD 2
1. Right-click on task-bar
2. Select 'Cascade windows'

METHOD 3
1. Alt-tab to lost window
2. Press Alt+space
3. Press m
4. Press any arrow key
5. Move mouse to re-position

[Courtesy of How-to Geek]

Installing Django Under Ubuntu 11-04

2011-08-13T10:47:00.000-07:00

From the $ prompt of the terminal:

$ sudo apt-get install python-django

TCP/IP Port Pipe - UNDER CONSTRUCTION

2011-08-08T11:17:00.000-07:00




import optparse

import socket, select, threading



class Pipe(threading.Thread):



  time_out = 5  

  buffer_size = 4096

  max_idle = 5

  

  def __init__(self, server_host, server_port, dclient_connxn):

    

    super(Pipe, self).__init__()

    

    self.server_host = server_host

    self.server_port = server_port

    self.server_addr = (server_host, server_port)

    

    self.client_connxn = client_connxn    

    

  def connect_to_server(self):

    self.server_sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)

    print(self.server_addr)

    self.server_sock.connect(self.server_addr)



  def log_request_response(self, req, resp):

    print('request')

    print(req)

    print('response')

    print(resp)

    

  def run(self):    

    self.connect_to_server()

    

    to_read = [self.client_connxn, self.server_sock]

    to_write = []

    to_watch_for_exception = to_read

    

    request = ''

    response = ''

    

    seconds_idle = 0

    

    while True:

      (ready_to_read, ready_to_write, experienced_exception) = select.select(to_read, to_write, to_watch_for_exception, 1)

      

      if (experienced_exception):

        self.log_request_response(request, response)  

        self.client_connxn.close()

        self.server_sock.close()

        break

      

      if (ready_to_read):

        seconds_idle = 0

      

        for waitable in ready_to_read:

          data = waitable.recv(buffer_size)

          if (waitable == self.client_connxn):

            out = self.server_sock

            request += data

          else:

            out = self.client_connxn

            log_to = response

            response += data

          out.send(data)

      

      else:

        seconds_idle += 1

        if (seconds_idle == max_idle):

          self.log_request_response(request, response)

          self.client_connxn.close()

          self.server_sock.close()

          break    



class PortListener():'''

  

  '''

  def __init__(self, listen_on_port, pipe_to_host, pipe_to_port, max_connxns=1):

    self.listen_on_port = listen_on_port

    self.pipe_to_host = pipe_to_host

    self.pipe_to_port = pipe_to_port



  def listen():

    

    listen_to_addr = ('127.0.0.1', self.listen_to_port)

    listen_socket = socket.socket(socket.AF_INET, socket.SOCK_STREAM)

    listen_socket.bind(listen_to_addr)

    listen_socket.listen(max_connxns)



    while True:

      # pause until client requests connection

      (client_connxn, client_addr) = listen_socket.accept()

      pipe = Pipe(self.pipe_to_host, self.pipe_to_port, client_connxn)

      pipe.start()



def setup_info_logger(log_file_path):

  logging.basicConfig(filename=log_file_path, level=logging.INFO)

  return logging.getLogger()



def parse_command_line():'''

  parse command line argument to populate dictionary

  return dictionary with keys = client_port, server_host, server_port, log_file_path

  returns None if mandatory option missing

  '''  

  parser = optparse.OptionParser()

  parser.add_option('--clientport', dest='client_port', help='port client to this port on localhost')

  parser.add_option('--serverhost', dest='server_host', help='server host, default = 127.0.0.1')

  parser.add_option('--serverport', dest='server_port', help='server port')

  parser.add_option('--logfilepath', dest='log_file_path', help='log file path')

  

  (options, args) = parser.parse_args()    

  

  if (options.client_port == None):

    print('--clientport is mandatory')

    return None

  if (options.server_port == None):

    print('--serverport is mandatory')

    return None



  d = {}

  

  if (options.log_file != None): d['log_file'] = options.log_file

  else: d['log_file'] = None  

  

  d['client_port'] = options.client_port

  

  if (options.server_host != None): d['server_host'] = options.server_host

  else: d['server_host'] = '127.0.0.1'

  

  d['server_port'] = options.server_port    

  

  return d



def main():

  opt = parse_command_line()

  logger = None

  if (opt['log_file_path'] != None):

    logger = setup_info_logger(opt['log_file_path'])

  listener = PortListener(opt['client_port'], opt['server_host'], opt['server_port']] 



if (__name__ == '__main__'):

  main()

Python TCP/IP Port Trickery

2011-08-07T11:15:00.000-07:00

KellBot - Tutorial: Writing a TCP server in Python

SUZUKI Hisao's - TinyProxy - Python HTTP Proxy

2011-08-06T02:13:00.000-07:00

Original Site

Script reproduced without permission:



#!/bin/sh -
"exec" "python" "-O" "$0" "$@"

__doc__ = """Tiny HTTP Proxy.

This module implements GET, HEAD, POST, PUT and DELETE methods
on BaseHTTPServer, and behaves as an HTTP proxy.  The CONNECT
method is also implemented experimentally, but has not been
tested yet.

Any help will be greatly appreciated.  SUZUKI Hisao
"""

__version__ = "0.2.1"

import BaseHTTPServer, select, socket, SocketServer, urlparse

class ProxyHandler (BaseHTTPServer.BaseHTTPRequestHandler):
    __base = BaseHTTPServer.BaseHTTPRequestHandler
    __base_handle = __base.handle

    server_version = "TinyHTTPProxy/" + __version__
    rbufsize = 0                        # self.rfile Be unbuffered

    def handle(self):
        (ip, port) =  self.client_address
        if hasattr(self, 'allowed_clients') and ip not in self.allowed_clients:
            self.raw_requestline = self.rfile.readline()
            if self.parse_request(): self.send_error(403)
        else:
            self.__base_handle()

    def _connect_to(self, netloc, soc):
        i = netloc.find(':')
        if i >= 0:
            host_port = netloc[:i], int(netloc[i+1:])
        else:
            host_port = netloc, 80
        print "\t" "connect to %s:%d" % host_port
        try: soc.connect(host_port)
        except socket.error, arg:
            try: msg = arg[1]
            except: msg = arg
            self.send_error(404, msg)
            return 0
        return 1

    def do_CONNECT(self):
        soc = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
        try:
            if self._connect_to(self.path, soc):
                self.log_request(200)
                self.wfile.write(self.protocol_version +
                                 " 200 Connection established\r\n")
                self.wfile.write("Proxy-agent: %s\r\n" % self.version_string())
                self.wfile.write("\r\n")
                self._read_write(soc, 300)
        finally:
            print "\t" "bye"
            soc.close()
            self.connection.close()

    def do_GET(self):
        (scm, netloc, path, params, query, fragment) = urlparse.urlparse(
            self.path, 'http')
        if scm != 'http' or fragment or not netloc:
            self.send_error(400, "bad url %s" % self.path)
            return
        soc = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
        try:
            if self._connect_to(netloc, soc):
                self.log_request()
                soc.send("%s %s %s\r\n" % (
                    self.command,
                    urlparse.urlunparse(('', '', path, params, query, '')),
                    self.request_version))
                self.headers['Connection'] = 'close'
                del self.headers['Proxy-Connection']
                for key_val in self.headers.items():
                    soc.send("%s: %s\r\n" % key_val)
                soc.send("\r\n")
                self._read_write(soc)
        finally:
            print "\t" "bye"
            soc.close()
            self.connection.close()

    def _read_write(self, soc, max_idling=20):
        iw = [self.connection, soc]
        ow = []
        count = 0
        while 1:
            count += 1
            (ins, _, exs) = select.select(iw, ow, iw, 3)
            if exs: break
            if ins:
                for i in ins:
                    if i is soc:
                        out = self.connection
                    else:
                        out = soc
                    data = i.recv(8192)
                    if data:
                        out.send(data)
                        count = 0
            else:
                print "\t" "idle", count
            if count == max_idling: break

    do_HEAD = do_GET
    do_POST = do_GET
    do_PUT  = do_GET
    do_DELETE=do_GET

class ThreadingHTTPServer (SocketServer.ThreadingMixIn,
                           BaseHTTPServer.HTTPServer): pass

if __name__ == '__main__':
    from sys import argv
    if argv[1:] and argv[1] in ('-h', '--help'):
        print argv[0], "[port [allowed_client_name ...]]"
    else:
        if argv[2:]:
            allowed = []
            for name in argv[2:]:
                client = socket.gethostbyname(name)
                allowed.append(client)
                print "Accept: %s (%s)" % (client, name)
            ProxyHandler.allowed_clients = allowed
            del argv[2:]
        else:
            print "Any clients will be served..."
        BaseHTTPServer.test(ProxyHandler, ThreadingHTTPServer)

W3 Schools' XML Validation Tool

2011-08-03T03:28:00.000-07:00

W3 Schools' XML Document Validator

MS SQL Server - Clear Cache - for Query Timing

2011-07-22T03:40:00.000-07:00

[Using MS-SQL Server] When timing a query for the purposes of optimization, the query may well run quicker on re-execution subsequent to the initial execution - due to caching by the db engine.

In order to meaningfully compare execution time across optimization attempts, the cache needs to be cleared, and this can be done by executing


DBCC DROPCLEANBUFFERS   
DBCC FREEPROCCACHE
go

between query timings.

To turn query timing on - SET STATISTICS TIME ON
To turn query timing off - STATISTICS TIME OFF

South African Direct Marketing Opt-Out List

2011-03-16T02:24:00.000-07:00

To register for the OptOut list for South African direct marketing:

SMS the letters DMA followed by your RSA ID number, to 34385.

or phone the RSA call centre on

0861 OPT OUT

Recursive Delete Folder & Files in Linux

2011-02-06T05:42:00.001-08:00

rm -Rf *

or

rm -Rf rootfolder

Export Create Table Script in mySQL

2011-01-22T05:27:00.000-08:00

SHOW CREATE TABLE TableName;

SpaceSniffer - Drive Space Allocation Mapping

2011-01-20T00:40:00.001-08:00

If you're looking for a quick and easy disk space mapper, then I suggest SpaceSniffer from Uderzo - it's a small download, runs fast, and has decent visualization.

dotNet eMail

2011-01-12T09:39:00.000-08:00

assembly: System.Net.Mail
classes: MailMessage, SmtpClient

---

MSDN Social thread:

public static extern IntPtr ShellExecute(
IntPtr hwnd,
string lpOperation,
string lpFile,
string lpParameters,
string lpDirectory,
int nShowCmd);

Public static void LaunchEmailClient(string mailURL)
{�
ShellExecute(IntPtr.Zero, "open", mailURL, "", "", 4);
}

You can refer http://msdn.microsoft.com/en-us/library/bb762153.aspx

---

Contact Us

Animated Icons/Images in WPF

2011-01-11T04:23:00.000-08:00

MediaElement Option
<MediaElement Source="animated.gif"/>

MSDN Article on Pack URI's

Stepping Through VS2010 Tests

2011-01-11T03:23:00.000-08:00

KirstinJ's Trick

Taunting dotNET - Rhino Mocks

2011-01-10T06:51:00.001-08:00

RhinoMocks is a best-practice Object Mocking Framework for dotNET written by uber-dev Ayende Rahien.

Official RhinoMocks Page

Central Forum - Google Group

Good Intro Examples
- Stephen Walther

http://en.wikibooks.org/wiki/How_to_Use_Rhino_Mocks/Introduction
http://www.ayende.com/wiki/Rhino+Mocks+Introduction.ashx
http://en.wikibooks.org/wiki/How_to_Use_Rhino_Mocks/Introduction
http://house9-code-samples.blogspot.com/2008/02/rhinomocks-basics.html

Martin Fowler - Mocks/Behaviour vs Stubs/State Testing:

... I've also adjusted my vocabulary to match that of the Gerard Meszaros's xUnit patterns book... Meszaros uses the term Test Double as the generic term for any kind of pretend object used in place of a real object for testing purposes... Meszaros then defined four particular kinds of double:

- DUMMY objects are passed around but never actually used. Usually they are just used to fill parameter lists.
- FAKE objects actually have working implementations, but usually take some shortcut which makes them not suitable for production (an in memory database is a good example).
- STUBS provide canned answers to calls made during the test, usually not responding at all to anything outside what's programmed in for the test. Stubs may also record information about calls, such as an email gateway stub that remembers the messages it 'sent', or maybe only how many messages it 'sent'.
- MOCKS are what we are talking about here: objects pre-programmed with expectations which form a specification of the calls they are expected to receive.

Komodo Edit - light-weight Python IDE - Ubuntu Linux

2011-01-09T09:11:00.001-08:00

Installing under Ubuntu

CPU & Memory Info in Linux

2011-01-08T05:28:00.000-08:00

cat /proc/meminfo
cat /proc/cpuinfo

Ubuntu 10-10 on the Lenovo X100e ThinkPad

2011-01-08T02:27:00.000-08:00

Installing Ubuntu Netbook Edition 10-10 Maverick Meerkat on the Lenovo X100e ThinkPad

I unsuccessfully attempted to use the PenDrive Universal Linux USB Installer, as recommended by the official 10-10 download page, as well as the USB Disk Creator from an older (9-10) live CD.

Specifically, I encountered the problem outlined here, namely

SYSLINUX 4.01 debian-20100714 EDD Copyright (C) 1994-2010 H. Peter Anvin et al
Unknown keyword in configuration file: gfxboot
boot:
vesamenu.c32: not a COM32R image

Various attempts at implementing suggested solutions failed, and so in the end I tried using UNetBootIn to create the USB bootable install, which has worked perfectly.

Importantly, the wireless LAN is seamlessly detected and operated by 10-10.

INSTALL/GENERAL
- justinsomnia
- petehowe
- semiantics

WLAN
- nulldevice
- how-to-linux

OPTIMISATION
- how-to-speed-up-ubuntu-910-on-x100e

10-10 Specific
- Customize 10-10

10-04
- karssen.com
- helmi-blebe
- decent post install guide

A Brief Review
Meerkat runs quite smoothly on my X100e with 2 MB or RAM. UI response is quite snappy, except for the Ubuntu button and following OS search functionality, which runs _very_ slowly for some unknown reason. Google Chromium runs v.fast. With the screen on bright, and the wireless lan card in use, you can literally watch the batter drain, and you'll get somewhere just under an hour. I can't get the proprietary video drivers to work under the std 32bit x86 binaries. I must try the AMD64bit binaries. All in all, quite happy. In terms of performance, I can listen to music in the background via rhythmbox, have a chrome instance open with a couple of tabs, and then develop python using Geany and the console, with no problems. The smart terminal has arrived.

UpDate 11-04
11-04 runs faster and smoother, with no more lag on using the Ubuntu button/OS search functionality. Prooprietary graphics drivers installed and run ok.

Global Exception Catching in WPF

2011-01-07T00:29:00.000-08:00

AppDomain.UnhandledException
- all threads in the AppDomain
MSDN
Dispatcher.UnhandledException
- single specific UI dispatcher thread.
Application.DispatcherUnhandledException
- main UI dispatcher thread in your WPF application
MSDN
stackoverflow

Kent Boogaart
Application.DispatcherUnhandledException is only raised if the exception was raised on the UI thread, whereas AppDomain.UnhandledException is raised for exceptions that occur on background threads. Typically I attach to both and run similar handling code. The only difference is that DispatcherUnhandledException allows you to "recover" by setting Handled to true. In other words, you could prompt your user to see whether they'd like to attempt to continue running (and potentially avoid data loss).

Exceptions in Managed Threads

---

MSDN
If an exception is not handled on either a background user interface (UI) thread (a thread with its own Dispatcher) or a background worker thread (a thread without a Dispatcher), the exception is not forwarded to the main UI thread. Consequently, DispatcherUnhandledException is not raised. In these circumstances, you will need to write code to do the following:

- Handle exceptions on the background thread.
- Dispatch those exceptions to the main UI thread.
- Rethrow them on the main UI thread without handling them to allow DispatcherUnhandledException to be raised.

---

Example of Subscribing to AppDomain.CurrentDomain.UnhandledException

App.xaml.cs:


protected override void OnStartup(StartupEventArgs e)
{
AppDomain.CurrentDomain.UnhandledException += new
  UnhandledExceptionEventHandler(this.AppDomainUnhandledExceptionHandler);
}

void AppDomainUnhandledExceptionHandler
(object sender, UnhandledExceptionEventArgs ea)
{
// handle the exception
}

Fluent API's

2010-12-28T04:15:00.000-08:00

Martin Fowler coins the phrase
http://martinfowler.com/bliki/FluentInterface.html

Wikipedia
http://en.wikipedia.org/wiki/Fluent_interface

Enable/Disable Windows Proxy

2010-12-27T23:41:00.000-08:00

http://ozansafi.wordpress.com/2009/07/05/enabledisable-change-ie-proxy-by-scriptprogrammatically/

To disable proxy:

Windows Registry Editor Version 5.00

[HKEY_CURRENT_USER\Software\Microsoft\Windows\CurrentVersion\Internet Settings]
"ProxyEnable"=dword:00000000

To enable proxy:

Windows Registry Editor Version 5.00

[HKEY_CURRENT_USER\Software\Microsoft\Windows\CurrentVersion\Internet Settings]
"ProxyEnable"=dword:00000001

To change proxy:

Windows Registry Editor Version 5.00

[HKEY_CURRENT_USER\Software\Microsoft\Windows\CurrentVersion\Internet Settings]
"MigrateProxy"=dword:00000001
"ProxyEnable"=dword:00000001
"ProxyHttp1.1"=dword:00000000
"ProxyServer"="http://ProxyServername:80"
"ProxyOverride"=""

Copy these to a .reg file and double click on them to do the trick. The good part of doing it this way is that it works on every IE version(well, I haven’t tried any IE lower than IE6 and it is able to change it without even opening up anything.

VS2010 Client Profile - Namespace Reference Invalid After Build

2010-12-24T02:00:00.001-08:00

So this is the scenario, in a project, add a reference to an assembly, then declare a variable of a type from the newly referenced assembly. Then type in the declaration, and you get the usual blue squiggly line. If you right-click then you get the option to add a 'using' reference to my assembly, and then bobs-your-uncle, all is good...

Until, you try to build the project, then for some ungodly reason VS no longer regards the namepace inclusion as valid, and spits out a

Error 377
The type or namespace name 'xx' could not be found (are you missing a using directive or an assembly reference?)

error, referring to exactly the same assembly ref that it just suggested be included.

This is, apparently, a dotNET 4 Client Profile Issue.

http://www.go4answers.com/Example/lost-references-while-building-project-143531.aspx
http://msdn.microsoft.com/en-us/library/cc668079.aspx

MS Castle Windsor [IOC Container] Cheat-Sheet

2010-12-17T03:46:00.001-08:00

Martin Fowler
IOC Containers and the Dependency Injection pattern

Wiki: Castle Windsor

Fluent API
Fluent Registration API

INSTANCE REGISTRATION
- Can you register an existing instance of a type?
- Castle Windsor – Registering Existing Object Instances
- Can you register an existing instance of a type in the container?

REGISTRATION & RESOLUTION OF NAMED INSTANCE

IWindsorContainer.Register(Component.For<ClassType>().Named("instanceKey").Instance(instanceOfClassType));

ClassType retrievedInstance = IWindsorContainer.Resolve("instanceKey");

StackOverflow Thread

REGISTER & RESOLVE BASED ON INTERFACE



Register Types Implementing Specified Interface:

container.Register(
  AllTypes.
  FromThisAssembly(). // register all types from parent assembly
  BasedOn). // that inherit/implement interface IDialogService
  WithService.FromInterface(). // allow resolution based on interface
  Configure(c => c.LifeStyle.Is(LifestyleType.Transient)) // construct new
);

Resolve Instance of Class by Interface

IDialogService dialogService = container.Resolve();

Note on Registering/Resolving Generic Lists by Instance
I have been unable to register & resolve generic lists, e.g. List, by instance.
However, if you wrap the generic list in a custom class, e.g.

public class IntList : List
{
}

then you can register & resolve by instance with no problems.

Techniques for Debugging WPF

2010-12-14T05:56:00.001-08:00

http://bea.stollnitz.com/blog/?p=52

Re-Usable Controls in WPF

2010-12-13T03:39:00.000-08:00

MSDN Article - Developing Reusable Controls with the Model-View-ViewModel Pattern
http://blogs.msdn.com/b/nathannesbit/archive/2009/03/13/developing-reusable-controls-with-the-model-view-viewmodel-pattern.aspx

WPF: Binding to Properties in your UserControl or Window
http://decav.com/blogs/andre/archive/2007/05/27/wpf-binding-to-properties-in-your-usercontrol-or-window.aspx

unable to copy file to the process cannot access because in use another process visual studio

2010-12-12T09:11:00.000-08:00

ISSUE

vs2010 build error: unable to copy file to the process cannot access because in use another process visual studio

FIX

add following lines of code to the pre-build event command line of your project.

if exist "$(TargetPath).locked" del "$(TargetPath).locked"
if exist "$(TargetPath)" if not exist "$(TargetPath).locked" move "$(TargetPath)" "$(TargetPath).locked"

Product Management

2010-12-08T04:15:00.000-08:00

1. automated build server
2. deployment history - date, version number (+svn), feature list
3. bug/issue tracking

Handling Excel Formula Errors

2010-12-03T03:13:00.000-08:00

the ISERROR() worksheet function can be used to test whether a cell or formula yields an error, and then by combination with an IF() function allows a branched response.

text mother mandelbrot

2010-11-14T06:49:00.000-08:00

zoom out ('Ctrl' + '-') on your browser to view the entire mandelbrot


--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------0---------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------00--------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------00--------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------00--------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------0---------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------000000-------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------000000-------------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------000000000------------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------0000000000-----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------000000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------0000000000-----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------0000000000-----------------------------------------------------------

------------------------------------------------------------------------------------------------------------------------------------000000000-----------------------------------------------------------

------------------------------------------------------------------------------------------------------------------------------------00000000------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------0000000------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------00000-------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------0--0---------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------0---0-0-0000000000000---0-----------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------00--0000000000000000000-0-----------------------------------------------------

-------------------------------------------------------------------------------------------------------------0------------00-0000000000000000000000--00-------------------------------------------------

----------------------------------------------------------------------------------------------------------------0---------00000000000000000000000000-00-------------------------------------------------

----------------------------------------------------------------------------------------------------------------0-00-------00000000000000000000000000-0-------------------------------------------------

-----------------------------------------------------------------------------------------------------------------000-----000000000000000000000000000000-------------------------------------------------

-----------------------------------------------------------------------------------------------------------------0000---00000000000000000000000000000000------------------------------------------------

----------------------------------------------------------------------------------------------------------------00000--00000000000000000000000000000000000----00000-------------------------------------

----------------------------------------------------------------------------------------------------------------00000-000000000000000000000000000000000000----00000-------------------------------------

----------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000--00000--------------------------------------

-----------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000--00000--------------------------------------

-----------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000-00000--------------------------------------

-------------------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000---------------------------------------

----------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000---------------------------------------

----------------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000-----------------------------------------

---------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000-----------------------------------------

---------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000----------------------------------------

---------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000----------------------------------------

----------------------------------------------------------------------------------------------------------000-000000000000000000000000000000000000000000000000000---------------------------------------

-----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000---------------------------------------

-----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000---------------------------------------

-----------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000-------------------------------------

------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000--------------------------------------

-----------------------------------------------------------------------0-----------------------------------00000000000000000000000000000000000000000000000000000000-------------------------------------

----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000-------------------------------------

-----------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000--0----------------------------------

----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000-00----------------------------------

--------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000000000---------------------------------

--------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000000000----------------------------------

---------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000000000000000----------------------------------

---------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000000------------------------------------

-------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000000000000000------------------------------------

-----------------------------------------------------------------------------0-------00-----------------0000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------00------00-----------------0000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------000-----0-0--0------------00000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------000--000000000-----------000000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------000000000000000-----------000000000000000000000000000000000000000000000000000000000000000----------------------------------

-----------------------------------------------------------------------------00000000000000000--------0000000000000000000000000000000000000000000000000000000000000000----------------------------------

------------------------------------------------------------------------------0000000000000000--------00000000000000000000000000000000000000000000000000000000000000000---------------------------------

------------------------------------------------------------------------------000000000000000000------000000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------0000000000000000000------000000000000000000000000000000000000000000000000000000000000000-----------------------------------

----------------------------------------------------------------------------000000000000000000000-----000000000000000000000000000000000000000000000000000000000000000-----------------------------------

----------------------------------------------------------------------------000000000000000000000-----000000000000000000000000000000000000000000000000000000000000000-----------------------------------

-------------------------------------------------------------------------000000000000000000000000-----000000000000000000000000000000000000000000000000000000000000000-----------------------------------

--------------------------------------------------------------------------000000000000000000000000---0000000000000000000000000000000000000000000000000000000000000000-----------------------------------

--------------------------------------------------------------------------000000000000000000000000---00000000000000000000000000000000000000000000000000000000000000000----------------------------------

--------------------------------------------------------------------------000000000000000000000000---000000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------0000000000000000000000000--000000000000000000000000000000000000000000000000000000000000000------------------------------------

-------------------------------------------------------------------------00000000000000000000000000--000000000000000000000000000000000000000000000000000000000000000------------------------------------

-------------------------------------------------------------------------00000000000000000000000000--00000000000000000000000000000000000000000000000000000000000000-------------------------------------

-------------------------------------------------------------------------000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000000-------------------------------------

-------------------------------------------------------------------------000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000000-------------------------------------

------------------------------------------------------------------------0000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000000-------------------------------------

------------------------------------------------------------------0-00--0000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------0000--0000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------00000-0000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------00000-0000000000000000000000000000-000000000000000000000000000000000000000000000000000000000000---------------------------------------

-----------------------------------------------------------------00000000000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000----------------------------------------

------------------------------------------0---------------------000000000000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000-----------------------------------------

-----------------------------000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000------------------------------------------

------------------------------------------0---------------------000000000000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000-----------------------------------------

-----------------------------------------------------------------00000000000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000----------------------------------------

------------------------------------------------------------------00000-0000000000000000000000000000-000000000000000000000000000000000000000000000000000000000000---------------------------------------

------------------------------------------------------------------00000-0000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------0000--0000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------0-00--0000000000000000000000000000-0000000000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------------0000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000000-------------------------------------

-------------------------------------------------------------------------000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000000-------------------------------------

-------------------------------------------------------------------------000000000000000000000000000-00000000000000000000000000000000000000000000000000000000000000-------------------------------------

-------------------------------------------------------------------------00000000000000000000000000--00000000000000000000000000000000000000000000000000000000000000-------------------------------------

-------------------------------------------------------------------------00000000000000000000000000--000000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------0000000000000000000000000--000000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------000000000000000000000000---000000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------000000000000000000000000---00000000000000000000000000000000000000000000000000000000000000000----------------------------------

--------------------------------------------------------------------------000000000000000000000000---0000000000000000000000000000000000000000000000000000000000000000-----------------------------------

-------------------------------------------------------------------------000000000000000000000000-----000000000000000000000000000000000000000000000000000000000000000-----------------------------------

----------------------------------------------------------------------------000000000000000000000-----000000000000000000000000000000000000000000000000000000000000000-----------------------------------

----------------------------------------------------------------------------000000000000000000000-----000000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------0000000000000000000------000000000000000000000000000000000000000000000000000000000000000-----------------------------------

------------------------------------------------------------------------------000000000000000000------000000000000000000000000000000000000000000000000000000000000000-----------------------------------

------------------------------------------------------------------------------0000000000000000--------00000000000000000000000000000000000000000000000000000000000000000---------------------------------

-----------------------------------------------------------------------------00000000000000000--------0000000000000000000000000000000000000000000000000000000000000000----------------------------------

-----------------------------------------------------------------------------000000000000000-----------000000000000000000000000000000000000000000000000000000000000000----------------------------------

-----------------------------------------------------------------------------000--000000000-----------000000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------000-----0-0--0------------00000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------00------00-----------------0000000000000000000000000000000000000000000000000000000000000-----------------------------------

-----------------------------------------------------------------------------0-------00-----------------0000000000000000000000000000000000000000000000000000000000000-----------------------------------

-------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000000------------------------------------

--------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000000------------------------------------

---------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000000------------------------------------

---------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000000000000000----------------------------------

--------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000000000----------------------------------

--------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000000000---------------------------------

----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000-00----------------------------------

-----------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000--0----------------------------------

----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000000-------------------------------------

-----------------------------------------------------------------------0-----------------------------------00000000000000000000000000000000000000000000000000000000-------------------------------------

------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000--------------------------------------

------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000--------------------------------------

-----------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000000000000-------------------------------------

-----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000---------------------------------------

-----------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000000000---------------------------------------

----------------------------------------------------------------------------------------------------------000-000000000000000000000000000000000000000000000000000---------------------------------------

---------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000----------------------------------------

---------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000----------------------------------------

---------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000-----------------------------------------

----------------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000-----------------------------------------

----------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000000000---------------------------------------

------------------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000---------------------------------------

------------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000000000--------------------------------------

-------------------------------------------------------------------------------------------------------------------00000000000000000000000000000000000000000000000--------------------------------------

-----------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000-00000--------------------------------------

-----------------------------------------------------------------------------------------------------------------000000000000000000000000000000000000000000--00000--------------------------------------

----------------------------------------------------------------------------------------------------------------0000000000000000000000000000000000000000000--00000--------------------------------------

----------------------------------------------------------------------------------------------------------------00000-000000000000000000000000000000000000----00000-------------------------------------

----------------------------------------------------------------------------------------------------------------00000--00000000000000000000000000000000000----00000-------------------------------------

-----------------------------------------------------------------------------------------------------------------0000---00000000000000000000000000000000------------------------------------------------

-----------------------------------------------------------------------------------------------------------------000-----000000000000000000000000000000-------------------------------------------------

----------------------------------------------------------------------------------------------------------------0-00-------00000000000000000000000000-0-------------------------------------------------

----------------------------------------------------------------------------------------------------------------0---------00000000000000000000000000-00-------------------------------------------------

-------------------------------------------------------------------------------------------------------------0------------00-0000000000000000000000--00-------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------00--0000000000000000000-0-----------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------0---0-0-0000000000000---0-----------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------0--0---------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------00000-------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------0000000------------------------------------------------------------

------------------------------------------------------------------------------------------------------------------------------------00000000------------------------------------------------------------

------------------------------------------------------------------------------------------------------------------------------------000000000-----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------0000000000-----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------0000000000-----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------000000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------0000000000-----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------00000000000----------------------------------------------------------

-----------------------------------------------------------------------------------------------------------------------------------000000000------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------000000-------------------------------------------------------------

-------------------------------------------------------------------------------------------------------------------------------------000000-------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------0---------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------00--------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------00--------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------00--------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------------0---------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Text MandelBrot

2010-11-14T06:34:00.000-08:00


------------------------------

------------------------------

--------------------00--------

--------------------00--------

-----------------0-0000-------

-----------------00000000-----

-----------------00000000-----

----------------000000000-----

------------000-000000000-----

-----------0000-000000000-----

-----0000000000000000000------

-----------0000-000000000-----

------------000-000000000-----

----------------000000000-----

-----------------00000000-----

-----------------00000000-----

-----------------0-0000-------

--------------------00--------

--------------------00--------

------------------------------

pyGTK - Events & Basic 3d

2010-11-11T10:41:00.000-08:00

Below is the code for a little exercise in basic pyGTK event-handling and basic 3-d, overhauling some code I wrote yonks ago in Borland Turbo Pascal.

dependencies: pyGTK



--- --- rot.py --- --- --- --- --- --- --- --- --- ---

import math

class Point2D(object):
    def __init__(self, x=None,y=None):
        self.x = x
        self.y = y

class Point3D(object):
    def __init__(self, x=None,y=None,z=None):
        self.x = x
        self.y = y
        self.z = z        

class Rot(object):
    
    rad_const = math.pi / 180.0  
    
    def rad(self, theta):
        return theta * Rot.rad_const    
        
    def __init__(self):
        
        self.sin_table = []
        self.cos_table = []
        
        for d in range(360):
            self.sin_table.append(math.sin(self.rad(d)))
            self.cos_table.append(math.cos(self.rad(d)))
        
        for i in [1]: # points            
            self.points = []        
            for i in range(24):
                self.points.append(Point3D())

            self.points[0].x =  10.0 
            self.points[0].z =   4.0
            self.points[1].x =   4.0
            self.points[1].z =  10.0
            self.points[2].x =  -4.0 
            self.points[2].z =  10.0
            self.points[3].x = -10.0 
            self.points[3].z =   4.0
            self.points[4].x = -10.0 
            self.points[4].z =  -4.0
            self.points[5].x =  -4.0 
            self.points[5].z = -10.0
            self.points[6].x =   4.0 
            self.points[6].z = -10.0
            self.points[7].x =  10.0 
            self.points[7].z =  -4.0

            for i in range(8):
                self.points[i].y = 30.0

            for i in range(8, 16):
                self.points[i].x = self.points[i - 8].x
                self.points[i].z = self.points[i - 8].z
                self.points[i].y = -30.0

            self.points[16].x =  20.0
            self.points[16].z =  20.0
            self.points[17].x = -20.0
            self.points[17].z =  20.0
            self.points[18].x = -20.0
            self.points[18].z = -20.0
            self.points[19].x =  20.0
            self.points[19].z = -20.0

            for i in range(16, 20):
                self.points[i].y = 30.0

            for i in range(20, 24):
                self.points[i].x = self.points[i - 4].x
                self.points[i].z = self.points[i - 4].z
                self.points[i].y = -30.0        
            
        
        self.x_off = 320.0
        self.y_off = 240.0
        self.z_off = 50.0

        self.z_deg = 0
        self.x_deg = 0
        self.y_deg = 0
            
    def flatten(self, cube):
        '''
        320 : 200 => 1 : 5 / 8 |  a.r of 4 : 3, height = 4 / 3 of width, therefore
        x : y => 1 : 5 / 6
        '''
        
        n = len(self.points)
        
        x_scale = 100.0
        y_scale = 100.0 # 83.0
        
        flat = []        
        for i in range(n):
            x = cube[i].x
            y = cube[i].y
            z = self.z_off - cube[i].z
            nx = int(self.x_off + (x / z * x_scale))
            ny = int(self.y_off + (y / z * y_scale))
            flat.append(Point2D(nx, ny))
            
        return flat


    def rotate(self, points, z, x, y):
        '''
        to rotate a point (oX, oY) through Alpha radians, counter-clockwise, about
        the z axis:
        nX = [Cos(Alpha) * oX] - [Sin(Alpha) * oY]
        nY = [Sin(Alpha) * oX] + [Cos(Alpha) * oY]
        '''
        
        rotated = []
        for i in range(len(points)):
            oX = points[i].x
            oY = points[i].y
            oZ = points[i].z

            # about z axis 
            nX = (self.cos_table[z] * oX) - (self.sin_table[z] * oY)
            nY = (self.sin_table[z] * oX) + (self.cos_table[z] * oY)
            oX = nX 
            oY = nY

            # about x axis 
            nZ = (self.cos_table[x] * oZ) - (self.sin_table[x] * oY)
            nY = (self.sin_table[x] * oZ) + (self.cos_table[x] * oY)
            oZ = nZ

            # about y axis 
            nX = (self.cos_table[y] * oX) - (self.sin_table[y] * oZ)
            nZ = (self.sin_table[y] * oX) + (self.cos_table[y] * oZ)

            rotated.append(Point3D(x=nX, y=nY, z=nZ))
            
        return rotated

    def draw_to_pixmap(self, points, pixmap, gc, style):
        '''
        '''
        # pixmap.draw_line(self.gc, x, y, self.w/2, self.h/2)  

        #  octal inlay flush with end plate 
        for i in range(7):
            pixmap.draw_line(gc, points[i].x, points[i].y, points[i + 1].x, points[i + 1].y)
        
        pixmap.draw_line(gc, points[7].x, points[7].y, points[0].x, points[0].y)

        # connections between octal inlays'pipe' 
        for i in range(8):
            pixmap.draw_line(gc, points[i].x, points[i].y, points[i + 8].x, points[i + 8].y)

        #  octal inlay flush with end plate 
        for i in range(8, 15):
            pixmap.draw_line(gc, points[i].x, points[i].y, points[i + 1].x, points[i + 1].y)
        
        pixmap.draw_line(gc, points[15].x, points[15].y, points[8].x, points[8].y)

        #  end plate of column 
        for i in range(16, 19):
            pixmap.draw_line(gc, points[i].x, points[i].y, points[i + 1].x, points[i + 1].y)
            
        pixmap.draw_line(gc, points[19].x, points[19].y, points[16].x, points[16].y)

        #  end plate of column 
        for i in range(20, 23):
            pixmap.draw_line(gc, points[i].x, points[i].y, points[i + 1].x,points[i + 1].y)
        
        pixmap.draw_line(gc, points[23].x, points[23].y, points[20].x, points[20].y)


    def iterate(self, pixmap, gc, style):
        '''
        '''
        rotated = self.rotate(self.points, self.z_deg, self.x_deg, self.y_deg)
        flattened = self.flatten(rotated)
        self.draw_to_pixmap(flattened, pixmap, gc, style)
        
    def move(self, x, y, z):
        
        self.z_deg = self.z_deg + int(z)
        self.x_deg = self.x_deg + int(y)
        self.y_deg = self.y_deg - int(x)       
        
        self.shake()

    def shake(self):

        if (self.z_deg >= 360):
            self.z_deg = self.z_deg - 360
        if (self.z_deg < 0):
            self.z_deg = self.z_deg + 360
        
        if (self.x_deg >= 360):
            self.x_deg = self.x_deg - 360
        if (self.x_deg < 0):
            self.x_deg = self.x_deg + 360

        if (self.y_deg >= 360):
            self.y_deg = self.y_deg - 360
        if (self.y_deg < 0):
            self.y_deg = self.y_deg + 360


--- --- run.py --- --- --- --- --- --- ---

import gtk
import gobject
import random
# ---
from rot import Rot

class Gfx(object):
    '''
    '''    
    def __init__(self):
        '''
        '''
        self.b1_down = False
        self.b2_down = False
        self.b3_down = False
        
        self.b1_x = None
        self.b1_y = None
        
        self.rot = Rot()        
        
        self.started = False
        
        self.i = 0
        
        self.win = gtk.Window(gtk.WINDOW_TOPLEVEL)
        self.win.set_title('Fractured Nature')
        self.gw = 640
        self.gh = 480 #int(float(self.gw) / 1.618)
        self.win.resize(self.gw, self.gh)
        self.win.set_position(gtk.WIN_POS_CENTER)
        self.win.connect('destroy', gtk.main_quit)
        #self.win.realize()

        self.da = gtk.DrawingArea()

        self.win.add(self.da)
        self.da.set_size_request(self.gw, self.gh)
        self.win.set_resizable(False)
        
        self.da.connect("expose-event", self.area_expose_cb)
        self.da.connect("button_press_event", self.button_press_event)
        self.da.connect("button_release_event", self.button_released_event)  
        self.da.connect("motion_notify_event", self.motion_notify_event)
        #self.da.connect("scroll_event", self.scroll_event)
            
        self.da.set_events(
            gtk.gdk.EXPOSURE_MASK | 
            gtk.gdk.BUTTON_PRESS_MASK | 
            gtk.gdk.BUTTON_RELEASE_MASK | 
            gtk.gdk.POINTER_MOTION_MASK #| 
         #   gtk.gdk.SCROLL_MASK            
            )
              
        self.da.show()
        self.win.show_all()
    
    def area_expose_cb(self, area, event):
        '''
        '''
        self.area = area
        
        self.style = self.da.get_style()
        self.gc = self.style.fg_gc[gtk.STATE_NORMAL]
        
        self.w, self.h = area.window.get_size()
        
        #for i in dir(area.window): print(i)
        self.started = True

        return True                
        
    def button_press_event(self, widget, event):                    

        if (event.button == 1):            
            self.b1_x = event.x
            self.b1_y = event.y
            self.b1_down = True
        elif (event.button == 3):            
            self.b3_z = event.x
            self.b3_down = True
        elif (event.button == 2):
            self.b2_down = True  
        elif (event.button == 4):
            print(4)
        elif (event.button == 5):
            print(5)
        
        return True

    def motion_notify_event(self, widget, event):
        
        if (self.b1_down == True):
            x = event.x
            y = event.y
            
            d_x = x - self.b1_x
            d_y = y - self.b1_y
            d_z = 0
            
            self.b1_x = x
            self.b1_y = y

            self.rot.move(d_x, d_y, d_z)
        
        elif (self.b3_down == True):
        
            z = event.x
            
            d_z = z - self.b3_z
            
            d_y = 0
            d_x = 0
            
            self.b3_z = z

            self.rot.move(d_x, d_y, d_z)
            
        return True
        
    def button_released_event(self, widget, event):                

        if (event.button == 1):
            self.b1_down = False
        elif (event.button == 2):
            self.b2_down = False
        elif (event.button == 3):
            self.b3_down = False     

        return True   
     

    def nop(self):
        '''
        '''        
        if (self.started != True):
            return True
        
        pixmap = gtk.gdk.Pixmap(self.da.window, self.gw, self.gh, depth=-1)
        pixmap.draw_rectangle(self.style.white_gc, True, 0, 0, self.gw, self.gh)
        
        self.rot.iterate(pixmap, self.gc, self.style)        
        
        self.area.window.draw_drawable(self.gc, pixmap, 0, 0, 0, 0, -1, -1)          
        self.area.show()
       
        return True # repeat

    



g = Gfx()

delay = 50
g.timer = gobject.timeout_add(delay, g.nop)

gtk.main()

WPF Attached Behaviours - Calling a Method on the View

2010-10-31T06:01:00.001-07:00

http://shujaatsiddiqi.blogspot.com/2010/08/attached-behaviors.html

IT Placement in the Netherlands

2010-10-29T02:02:00.001-07:00

The White Door
http://thewhitedoor.com/

Classes from XML, XSD with xsd.exe

2010-10-27T04:35:00.001-07:00

MS supplies a command-line tool that generates C# classes from XSD/XML/Xetc.

ML Schema Definition Tool (Xsd.exe)
http://msdn.microsoft.com/en-us/library/x6c1kb0s(VS.80).aspx

Easy Proxy Switching with Chrome

2010-10-27T04:21:00.000-07:00

I find myself in a situation where I have to switch my proxy on and off very frequently (_many_ times a day), and it's a bit of a hassle to go through the whole multi-click rigmarole, but, thanks to a handy Chrome extension called, somewhat unimaginatively, but wholly functionally - 'SwitchProxy' @ http://www.chromeextensions.org/utilities/switch-proxy/.

I'll try and report back if this has resulted in the total compromising of my security. In the mean time, let's hope not.

E72 Mail for Exchange

2010-10-25T00:50:00.000-07:00

Connecting Nokia's with Mail for Exchange
http://copeohs.net/blogs/creativepossibilities/archive/2010/03/09/Connecting-Nokia_2700_s-with-Mail-for-Exchange.aspx

geany

2010-10-24T12:23:00.000-07:00

Finally, in search of a light-weight text editor for ubuntu - one that has code folding and a decent selection of editing facilities (i.e. a tier above gedit and scite), I come to GEANY.

idiotuser@computer:~$ sudo apt-get install geany

Configure with a dark colour scheme from http://download.geany.org/contrib/oblivion2.tar.gz, and you're good to go.

---

Quick Punt:

I've been using Geany for a couple of months now, and I can whole-heartedly recommend it. It could do with a couple more short-cut keys (but maybe they're actually in there somewhere and I've just missed them), but other than that, its a winnner. I've been using it on my Lenovo X100e netbook running Ubuntu 10-1- Meerkat, and it runs snappily, so I can do python dev complete with both basic predictive text and symbol explorers, v.nice. For those of you who are not quite VI/EMACS streetfighters, but want a fast but solid python IDE, rub this lamp.

EMACS

2010-10-24T09:04:00.000-07:00

COLOUR SCHEME
stack overflow - http://stackoverflow.com/questions/1132919/how-do-i-set-up-emacs-colors-correctly
emacs fu - http://emacs-fu.blogspot.com/2009/03/color-theming.html

PyXTree - pyGTK TreeView ElementTree XML Viewer

2010-10-24T05:04:00.001-07:00

PyXTree is a minimal python xml viewer.

Written in python (download), pyxtree uses the treeview and scrolledwindow controls from the pyGTK download) UI, together with the ElementTree xml library that is included in the python standard library.



# --- --- --- --- --- --- --- --- --- --- --- --- 
from optparse import OptionParser
# pyGTK --- --- --- --- --- --- --- --- ---
import pygtk
pygtk.require('2.0')
import gtk
# ElementTree - --- --- --- --- --- --- ---
import xml.etree.ElementTree as ET
# --- --- --- --- --- --- --- --- --- --- --- --- 
import sys

xml_2_ns = {
  'http://www.s3.org/XML/1998/namespace' : 'xml',
  }

ns_2_xml = {
  'xml' : 'http://www.s3.org/XML/1998/namespace',
}
  
def extend_tree(treestore, element, parent_node, ns_list):
  '''
  '''

  #import pdb; pdb.set_trace()

  node_label = '%s' % strip_ns_from_str(element.tag, ns_list)
  
  if element.text != None:
    element_text = element.text.strip()
    if (len(element_text) > 0):
      element_text = strip_ns_from_str(element_text, ns_list)        
      #discard = treestore.append(node, [element_text])
      node_label = 'e %s :  %s' % (node_label, element_text)
  
  node = treestore.append(parent_node, [node_label])  

  # add attribute name/val pairs to node
  for name, value in element.items():
    name = strip_ns_from_str(name, ns_list)
    value = strip_ns_from_str(value, ns_list)
    label = 'a %s =  %s' % (name, value)
    treestore.append(node, [label])   
  
  # recurse over children
  for child_element in element.getchildren():
    child_node = extend_tree(treestore, child_element, node, ns_list)      

  return node
    
def etree_to_gtk_treestore(tree):
  '''
  construct gtk.TreeStore(str) from ElementTree
  '''
  treestore = gtk.TreeStore(str) 
 
  ns_list = ns_list_from_tree(tree)
  
  element = tree.getroot()
  
  node_label = '%s' % strip_ns_from_str(element.tag, ns_list)  
  
  if element.text != None:
    element_text = element.text.strip()
    if (len(element_text) > 0):
      element_text = strip_ns_from_str(element_text, ns_list)
      node_label = 'e %s :  %s' % (node_label, element_text)
  
  node = treestore.append(None, [node_label])  
  
  for child_e in element.getchildren():
    extend_tree(treestore, child_e, node, ns_list)  
    
   # add attribute name/val pairs to node
  for name, value in element.items():
    name = strip_ns_from_str(name, ns_list)
    value = strip_ns_from_str(value, ns_list)    
    label = '%s = %s' % (name, value)
    treestore.append(None, [label])
  
  # if ns is global
  for ns in ns_list:
    label = 'xmlns : %s' % ns
    treestore.append(None, [label])
  
  return treestore 

def ns_from_string(s):
  left = s.find('{')
  right = s.find('}')
  ns = s[left+1:right]      
  return ns

def process_potential_ns_string(s, ns_list):

  if s == None:
    return

  if (s.find('{') != -1) and (s.find('}') != -1):
    ns = ns_from_string(s)
    if (ns not in ns_list):
      ns_list.append(ns)
 
def ns_list_from_element(el, ns_list):

  # tag
  process_potential_ns_string(el.tag, ns_list)
  # text
  process_potential_ns_string(el.text, ns_list)  
  
  # attributes
  for name, value in el.items():
    process_potential_ns_string(name, ns_list)
    process_potential_ns_string(value, ns_list)
  
  for child_el in el.getchildren():
    ns_list_from_element(child_el, ns_list)    
  
  return ns_list
  
def ns_list_from_tree(etree):
  '''
  '''  
  ns_list = []  
  root_e = etree.getroot()    
  
  # tag
  process_potential_ns_string(root_e.tag, ns_list)
  # text
  process_potential_ns_string(root_e.text, ns_list)  
  
  # attributes
  for name, value in root_e.items():
    process_potential_ns_string(name, ns_list)
    process_potential_ns_string(value, ns_list)
  
  # child elements
  for child_el in root_e.getchildren():
    ns_list_from_element(child_el, ns_list)

  return ns_list
  
def strip_ns_from_str(s, ns_list):
  stripped = str(s)
  for ns in ns_list:
    token = '{%s}' % ns
    loc = stripped.find(token)
    if (loc != -1):
      stripped = stripped[:loc] + stripped[loc + len(token):len(stripped)]
      
  return stripped
  
class XMLTreeView:
  '''
  '''
  def delete_event(widget, event, data=None):
    '''
    not an instance method, cuz gtk will not call as such
    '''
    gtk.main_quit()
    return False
    
  def __init__(self, path, title='pyxtree - python XML tree viewer', xsize=900, ysize = 500):
    '''
    '''  
    etree = ET.parse(path)    
    self.treestore = etree_to_gtk_treestore(etree) 

    self.window = gtk.Dialog()
    self.window.connect("destroy", self.delete_event)  
    self.window.set_border_width(0)      
    
    self.swin_tree = gtk.ScrolledWindow()
    self.swin_tree.set_border_width(10)
    self.swin_tree.set_policy(gtk.POLICY_AUTOMATIC, gtk.POLICY_ALWAYS)
    self.window.vbox.pack_start(self.swin_tree, True, True, 0)
    
    self.swin_text = gtk.ScrolledWindow()
    self.swin_text.set_border_width(10)
    self.swin_text.set_policy(gtk.POLICY_AUTOMATIC, gtk.POLICY_ALWAYS)
    self.window.vbox.pack_start(self.swin_text, True, True, 0)    
    
    self.window.set_title(title)
    self.window.set_size_request(xsize, ysize)
    self.window.connect("delete_event", self.delete_event)

    # create the TreeView using treestore
    self.treeview = gtk.TreeView(self.treestore)
    self.tvcolumn = gtk.TreeViewColumn(path)
    self.treeview.append_column(self.tvcolumn)
    self.cell = gtk.CellRendererText()
    # add the cell to the tvcolumn and allow it to expand
    self.tvcolumn.pack_start(self.cell, True)
    # set the cell "text" attribute to column 0 - retrieve text
    # from that column in treestore
    self.tvcolumn.add_attribute(self.cell, 'text', 0)
    # make it searchable
    self.treeview.set_search_column(0)
    # Allow sorting on the column
    #self.tvcolumn.set_sort_column_id(0)
    # Allow drag and drop reordering of rows
    #self.treeview.set_reorderable(True)
    
    self.swin_tree.add_with_viewport(self.treeview)    
    self.swin_tree.show()
    
    xfile = open(path, 'r')
    xtext = xfile.read()
    xfile.close()
    
    label = gtk.Label(xtext)
    
    # ns_list = ns_list_from_tree(etree)
    
    # ns_str = ''
    # for ns in ns_list:
      # ns_str = ns_str + str(ns) + '\n'    
    
    # label = gtk.Label(ns_str)

    label.set_alignment(xalign=0, yalign=0.5) 
    
    self.swin_text.add_with_viewport(label)    
    self.swin_text.show()    
    
    self.window.show_all()

def main(path = None):  
  '''
  '''
  if (path == None):
    
    filechooser = gtk.FileChooserDialog(
      title=None,
      action=gtk.FILE_CHOOSER_ACTION_OPEN,
      buttons=(gtk.STOCK_CANCEL,gtk.RESPONSE_CANCEL,gtk.STOCK_OPEN,gtk.RESPONSE_OK))
    
    filter_stdxmlfiles = gtk.FileFilter()
    filter_stdxmlfiles.set_name("Std XML Files")
    filter_stdxmlfiles.add_pattern("*.xml")
    filter_stdxmlfiles.add_pattern("*.wsdl")
    filechooser.add_filter(filter_stdxmlfiles)
  
    filter_allfiles = gtk.FileFilter()
    filter_allfiles.set_name("All files")
    filter_allfiles.add_pattern("*")
    filechooser.add_filter(filter_allfiles)
    
    response = filechooser.run()    
    
    if response == gtk.RESPONSE_OK:
      path = filechooser.get_filename()
    elif response == gtk.RESPONSE_CANCEL:
      pass
      #log failure

    filechooser.destroy()
  
  if (path != None):
    tree_view = XMLTreeView(path)
    gtk.main()
  return
  
def src_file_from_cmd_args(args):
  '''
  '''
  akapy = [
    'pyxtree',
    'pyxtree.py',
    'python',
    'python.exe',
    'python2.5',
    'python25.exe',
    ]  
  cleaned = []
  for arg in args:
    washed = arg.strip().lower()
    if (washed not in akapy) and (washed.find('python') == -1):
      cleaned.append(washed)    
  if len(cleaned) == 0:
    cleaned = [None]  
  return cleaned

def configure_logging(LOG_FILENAME='pyxtree.log'):
  import logging  
  logging.basicConfig(filename=LOG_FILENAME,level=logging.INFO)
  log = logging.getLogger()
  return log
  

def setup_command_line_options():
  '''
  using optparse
  define command line arguments
  return target filename, None if none specified
  '''
  parser = OptionParser()
  parser.add_option('-f', dest='filename', help='target xml file to view')
  (options, args) = parser.parse_args()
  return(options.filename)  

if __name__ == "__main__":
  
  print('\nPyXTree - david.barkhuizen@gmail.com')
  print('help:  pyxtree -h\n')
  
  xmlfilepath = setup_command_line_options()  
  
  log = configure_logging()  
  
  log.info('target file specified at command line = %s' % xmlfilepath)
  main(path=xmlfilepath)

WPF Tutorials

2010-10-21T07:52:00.000-07:00

http://bea.stollnitz.com/blog/?page_id=47

Useful DataBase MetaData Scripts

2010-10-21T05:32:00.001-07:00

1. given a column name, return a list of tables with similar columns names


  declare @targetColumnName varchar(500)
  set @targetColumnName = '%YourTargetColumnNameHere%'

  select so.[name] as TableName, sc.[name] as ColumnName  
  from sysobjects so
  inner join syscolumns sc on (so.[id] = sc.[id])
  where (so.[type] = 'U') and (sc.[name] like @targetColumnName)

2. given a table name, return a list of tables with similar name


  declare @targetTableName varchar(500)
  set @targetTableName = '%Entity%'

  select so.[name] as TableName
  from sysobjects so
  where (so.[type] = 'U') and (so.[name] like @targetTableName)

MySQLdb - 1153, 'Got a packet bigger than 'max_allowed_packet' bytes'

2010-09-12T05:45:00.001-07:00

the technology

- mySQL Server 5.?
- python 2.6
- MySQLdb 2.3.1?
- Windows 7

the scenario

1. import MySQLdb
2. create a connection to the db:
> connxn = MySQLdb.connect(params_dict)
3. loop, re-using the connection, each time inserting say 250 records in one query
> cursor = connxn.cursor()
> cursor.execute(multi_record_insert_statement)
> cursor.close()
> connxn.commit()

problem is, i was getting the following errors:

- 1153, 'Got a packet bigger than 'max_allowed_packet' bytes'
then, when i tried to create a new connection, i was getting
- 2006, 'MySQL server has gone away'

a solution was to edit the mysql service/daemon config file and increase the 'max_allowed_packet' value from its defaut value of 1 MB (1M), to something less aenemic. e.g 4MB (4M).

add the following line:
max_allowed_packet=4M

to the mysql config file 'my.ini', which is typically located @
c:\program files\mysql\mysql server 5.1\my.ini

ubuntu splash screen

2010-09-11T10:05:00.000-07:00

How to change the gnome splashimage.
1. Put the splash image you want in "png" format and store it in /usr/share/pixmaps/splash. (You can use Nautilus or the "cp" or the "mv" command from the terminal window if you want. Just remember to use "sudo" before your command. )
2. Press ALT-F2 then at the prompt type "gconf-editor" (without the quotes).
3. Click on "apps" then "gnome-session" then "options".
4. To the right of the Name "splash_image" double click on the Value "splash/ubuntu-splash.png".
5. Change "splash/ubuntu-splash.png" to reflect your new splash image: "splash/newsplash.png".
6. Click on "File" then "Quit".
7. Logout then login in again to see your new splashimage.

ssh to ubuntu machine

2010-09-11T02:53:00.000-07:00

http://mybroadband.co.za/vb/showthread.php/52204-How-to-do-VPN-with-iBurst-with-Linux

https://wiki.ubuntu.com/AdvancedOpenSSH

Did you install the SSH server on your Ubuntu box? Check with this:
Code:

which sshd

and if you installed check with this if it's running:
Code:

ps -ef | grep sshd

If both are true then check if you have it listening:
Code:

netstat -aln | grep ":22"

Kind regards,

Eric

Make sure SSH is running on Ubuntu:
Code:

ps -ae | grep sshd

It should return something like:
Code:

720 ? 00:00:00 sshd

king james bible word freq distribution analysis - open doc sheet

2010-09-10T08:13:00.001-07:00

Python is Not Java - PJ Eby

2010-09-09T09:00:00.000-07:00

When arriving at python from a statically typed OO language such as c# or java, many people are initially tempted to emulate the formalism required by a statically typed language. Like S&M being permissible in certain liberal jurisdictions, the free-form multi-paradigm environment that is python allows you to follow your slavish inclinations if you so desire, but it would be entirely your own choice - as python generally always offers alternatives, and often a more compact or concise one than that which first comes to the the python-naive mind.

Phillip J. "PJ" Eby
Python is Not Java

The Joel Test

2010-09-09T08:43:00.000-07:00

http://www.joelonsoftware.com/articles/fog0000000043.html
http://en.wikipedia.org/wiki/The_Joel_Test
http://stackoverflow.com/questions/402050/administering-the-joel-test

The Joel Test

Do you use source control?
Can you make a build in one step?
Do you make daily builds?
Do you have a bug database?
Do you fix bugs before writing new code?
Do you have an up-to-date schedule?
Do you have a spec?
Do programmers have quiet working conditions?
Do you use the best tools money can buy?
Do you have testers?
Do new candidates write code during their interview?
Do you do hallway usability testing?

Use dotNET 2.0 Assembly in dotNET 4.0

2010-09-03T07:18:00.000-07:00

ERROR

Mixed mode assembly is built against version 'v2.0.50727' of the runtime and cannot be loaded in the 4.0 runtime without additional configuration information.

FIX

ensure that app.config contains the following

Exception Handling in Python

2010-09-02T07:34:00.000-07:00

quoted directly from Doug Hellman


#!/usr/bin/env python

import sys
import traceback

def throws():
    raise RuntimeError('error from throws')
    
def nested():
    try:
        throws()
    except Exception, original_error:
        try:
            raise
        finally:
            try:
                cleanup()
            except:
                pass # ignore errors in cleanup

def cleanup():
    raise RuntimeError('error from cleanup')

def main():
    try:
        nested()
        return 0
    except Exception, err:
        traceback.print_exc()
        return 1

if __name__ == '__main__':
    sys.exit(main())

This construction prevents the original exception from being overwritten by the latter, and preserves the full stack in the traceback.

WPF Navigation OverView

2010-09-01T06:32:00.001-07:00

file:///C:/Users/david/Desktop/coding_ref/dotNET/WPF/WPF%20Navigation%20-%20Paul%20Stovell.htm

Microsoft Inductive User Interface Guidelines

2010-09-01T06:31:00.000-07:00

Microsoft Inductive User Interface Guidelines

WPF - Error 1 - Program does not contain a static 'Main' method suitable for an entry point

2010-08-26T01:35:00.000-07:00

Error 1 Program does not contain a static 'Main' method suitable for an entry point.

The scenario in which this arose for me was after importing a WPF project built in VS2008 into VS2010.

Solution

Set the 'build action' property on App.xaml to 'Application Definition'.

To Execute a VSTO from a NetWork Drive

2010-08-24T04:27:00.000-07:00

To Add a DLL to the GAC under Windows7
http://www.codeproject.com/KB/winsdk/AddToGAC.aspx

location of gacutil.exe under Windows7
C:\Program Files (x86)\Microsoft SDKs\Windows\v7.0A\Bin

location of caspol.exe
C:\Windows\Microsoft.NET\Framework\v4.0.30319

reset nokia e72

2010-08-22T11:35:00.000-07:00

hard reset
*#7370# code = 12345

soft reset (retain personal info)
*#7780#

Windows7 Power Scheme from the Command Line - PowerCFG

2010-08-17T10:17:00.000-07:00

open an admin command prompt by right-clicking on the command prompt, which can be found @ (Start > All Programs > Accessories), and selecting 'run as administrator'.

to list existing power schemes and associated GUIDs
powercfg -l

select guid (right-click > mark), copy (enter)

to set the active config
powercfg -s guid

debugging django

2010-08-15T11:01:00.001-07:00

http://simonwillison.net/2008/May/22/debugging/

sqLite

2010-08-15T09:01:00.000-07:00

Dr Dobbs
http://www.drdobbs.com/184401773;jsessionid=0COIHAUN55BUJQE1GHOSKH4ATMY32JVN

limitations of sqlite
- http://www.sqlite.org/omitted.html
- http://www.sqlite.org/limits.html
- http://www.sqlite.org/limits.html

Data Access - Context based vs Generic

2010-08-06T02:41:00.000-07:00

http://ayende.com/Blog/archive/2010/08/06/data-access-is-contextual-a-generic-approach-will-fail.aspx?utm_source=feedburner&utm_medium=feed&utm_campaign=Feed:+AyendeRahien+(Ayende+%40+Rahien)

Agile Dev & Pair Programming

2010-08-06T02:40:00.000-07:00

Martin Fowler from Thoughtworks speaks at Univ du SI
http://universite-du-si.com/fr/conferences/6/sessions/909

http://agilemanifesto.org/
http://martinfowler.com/articles/newMethodology.html
http://www.scrum.org/

Ken Schwaber
http://www.youtube.com/watch?v=IyNPeTn8fpo

Agile Modeling
http://www.agilemodeling.com/essays/introductionToAM.htm

Debugging Managed Code Called from an UnManaged External EXE

2010-08-03T01:21:00.000-07:00

MSDN Bug Report with Problem Description:

Cannot debug .NET 2.0/3.0/3.5 code using F5 in mixed mode from native c++ projects or c# project with 'start external program' set to native .exe.

For pure native c++ projects, when mixed mode debugging is selected in the properties of the startup project and the user presses 'F5', VS 2010 starts debugging for native and .NET 4.0 code - this assumption is not justified, since the user may want to debug native and .NET 2.0 code.

MSDN Fix:

There are two scenarios however that people have been encountering since Visual Studio 2010 released where Visual Studio cannot correctly determine which engine to attach with, and therefore uses the default of 4.0 leaving 2.0/3.0/3.5 applications “un-debuggable”; (1) developing a class library plug-in for a third party application (Excel, Work, AutoCAD, etc), and (2) interop debugging when launching a native .exe project. In both cases the symptoms will be the same, you will be unable to hit breakpoints in your managed code (they will be hollow with a message that “No symbols have been loaded for this document”) as well as being unable to step into the managed code.

As I explained above, the cause of this is the managed application is 3.5 or previous, and the debugger is attached with the 4.0 engine. The best workaround is to add a tag to your application’s *.exe.config file. For example, if I am debugging the application foo.exe I would edit (or create if necessary) the foo.exe.config file in the same directory as foo.exe. I would then add the tag with the correct version of the .NET runtime in the section as shown in the example below. This will let Visual Studio know which version of the .NET runtime you will be running (so if you are developing a class library plug-in for Excel, you would add the tag to the excel.exe.config file).


<?xml version ="1.0"?>
<configuration>
<startup>
<supportedRuntime version="v2.0.[version on your machine]" />
</startup>
</configuration>

To determine the correct [version on your machine] look in the “C:\Windows\Microsoft.NET\Framework” directory for the most recent “v2.0.xxxxx” folder.

change apache/apache2 port

2010-07-31T11:57:00.000-07:00

'ports.conf', if you're using ubuntu, is located @ '/etc/apache' (apache), '/etc/apache2' (apache2)

$ sudo gedit etc/apache2/ports.conf

netwrokking

2010-07-30T00:38:00.000-07:00

http://blog.ksplice.com/2010/07/learning-by-doing-writing-your-own-traceroute-in-8-easy-steps/

to mount a disk in linux

2010-07-25T03:51:00.000-07:00

all devices are listed as files in /dev

e.g. $ ls -l /dev
for a list of all devices in /dev

to filter it down to devices containing the string 'sda'
$ ls -l /dev | grep -i sda

which for example returns

ptysd
sda
sda1
sda2
sda5
sdb
... and more

then
$ sudo fdisk -l /dev/sda

fdisk in this case yields partition information for the device
fdisk --help for usage

also
$ cat /var/log/messages

mod_wsgi

2010-07-25T02:58:00.001-07:00

mod_wsgi is now the effective supercedent of mod_python

http://code.google.com/p/modwsgi/

ubuntu package = libapache2-mod-wsgi

ERROR
apache2: Could not reliably determine the server's fully qualified domain name, using 127.0.1.1 for ServerName
FIX - courtesy of Mohamed Aslam

http://mohamedaslam.com/how-to-fix-apache-could-not-reliably-determine-the-servers-fully-qualified-domain-name-using-127011-for-servername-error-on-ubuntu/

What is mod_python ?

2010-07-25T02:46:00.000-07:00

mod_python
1. o'Reilly article by Gregory Trubetskoy
2. WikiPedia

but, most importantly, it appears that
MOD_PYTHON IS DEAD !

LONG LIVE MOD_WSGI !
WSGI Project Page @ Google Code

modpython-project-is-now-officially-dead
modpython-project-soon-to-be-officially-dead
from django
Blog Piece
StackOverflow Thread

to run a pythonscript from ubuntu command line

2010-07-25T02:10:00.000-07:00

to run a pythonscript from ubuntu command line

to execute script 'hw.py'
from the command line
in the director of 'hw.py' [i.e. if you entered 'ls' you would see hw.py in the listing)

first, make script executable by granting rights
$ sudo chmod +x hw.py

add the following line to the beginning of the script
#!/usr/bin/python

this instructs the shell to hand the script over to the the python runtime binary,
which is located /usr/bin/python

mssql-08 sample databases

2010-07-21T00:46:00.000-07:00

available from CodePlex:

official ms sample databases
community samples

DocPy - Python Source Doc Gen

2010-07-20T14:49:00.000-07:00




# docpy.py - david.barkhuizn@gmail.com

# 1.    module methods - signature, followed by docstring
# 2.    module fields ?
# 3.    module classes
#           class name, parent class, __init__ method parameters & docstring
#           instance fields (get from self.? refs in __init__ method)

# ---------------------------------------------------------------

# ISSUES
# need to strip out classes before extracting method info
# can't handle multi-line method signatures

# ---------------------------------------------------------------

import sys

# ---------------------------------------------------------------

single_marker = '\'\'\''
double_marker = '\"\"\"'    

# ---------------------------------------------------------------        

class MethodInfo:
    
    def __init__(self, method_name, params, docstrings):
        '''
        method_name - string
        params - list of param name strings        
        '''
        self.method_name = method_name
        self.params = params
        self.docstrings = docstrings      

# ---------------------------------------------------------------

def load_text_file(file_path):
    '''
    return list of lines in text file @ 'file_path'
    '''

    try:
        text_file = open(file_path, 'r')
        text_block = text_file.read()
        lines = text_block.split('\n')
        text_file.close()
        return lines
        
    except Exception, err:   
        print('error during reading of text file %s' % file_path)
        print(err)
        return []

def src_file_path_from_cmdargs():

    valid_args = []    

    for arg in sys.argv:
        if arg.lower() not in ['docpy.py', 'python']:        
            valid_args.append(arg.lower())
   
    return 'docpy.py'
   
    if len(valid_args) != 1:
        return ''
    else:
        return valid_args[0]
        
def get_sig_line_idxs(lines):
    '''
    lines = list of lines in python source file (in sequence)
    '''    
    token = 'def '   
    
    indices = []
    
    for i in range(len(lines)):
        if lines[i].strip()[:4] == token:
            indices.append(i)

    return indices

def parse_method_sig(sig):    

    # e.g.'    def parse_methodsig(sig):#comment    '
    
    sig = sig.strip()
    # e.g.'def parse_methodsig(sig):#comment'
    
    sig = sig[4:len(sig)]
    # e.g.'parse_methodsig(sig):#comment'
    
    i = sig.find('#')
    if i != -1:
        sig = sig[:i-1]
    # e.g.'parse_methodsig(sig):
    
    left = sig.find('(')
    right = sig.rfind(')')
    
    meth_name = sig[:left]
    
    params = []
    
    if right - left != 1:
    
        params = sig[left+1:right]
        
        params = params.replace(',', ' ')
        
        got_double = True
        while got_double == True:    
            got_double = (params.find('  ') != -1)
            if got_double:
                params = params.replace('  ', ' ')
        
        params = params.split(' ')
    
    return MethodInfo(meth_name, params, [])   
    
def extract_single_line_docstring(docstring):
    '''example of single line method docstring'''
    
    lsingle = docstring.find(single_marker)
    ldouble = docstring.find(double_marker)
    
    marker = ''
    left = -1
    if lsingle != -1:
        marker = single_marker
        left = lsingle
    elif ldouble != -1:
        marker = double_marker
        left = ldouble
    else:
        return ''
        
    right = docstring.rfind(marker)
    
    if (right != -1) and (right != left):
        return docstring[left+3:right]
    else:
        return ''
  
def strip_leading_triplequotes(line):
    
    left = line.find(single_marker)
    if left == -1:
        left = line.find(double_marker)
        if left == -1:
            return ''
        
    return line[left + 3:]

def strip_trailing_triplequotes(line):
    
    right = line.rfind(double_marker)
    if right == -1:
        right = line.rfind(double_marker)
        if right == -1:
            return ''
        
    return line[:right]
    
def extract_docstrings(lines, meth_sig_idx, next_meth_sig_idx):

    # determine line indices of starting and ending triple quotes
    
    start = -1
    end = -1
    
    for i in range(meth_sig_idx + 1, next_meth_sig_idx):
        
        line = lines[i]
        
        sidx = line.find(single_marker)
        
        if sidx == -1:
            sidx = line.find(double_marker)        
        
        if sidx != -1:
            if start == -1:
                start = i
            else:
                end = i
                break

    if start == -1:
        return []
    elif end == -1:
        single_line = extract_single_line_docstring(lines[start])
        if single_line != '':
            return [ single_line ]
        else:
            return []
    else:
        docstrings = []
        
        for i in range(start, end + 1):
            no_whitespace = lines[i].strip()
            if i == start:
                stripped = strip_leading_triplequotes(no_whitespace)
                if stripped != '':
                    docstrings.append(stripped)
            elif i == end:
                stripped = strip_trailing_triplequotes(no_whitespace)
                if stripped != '':
                    docstrings.append(stripped)
            else:
                docstrings.append(no_whitespace)
        
        return docstrings

def get_method_info(lines, meth_sig_idx, next_meth_sig_idx):
    
    method_info = parse_method_sig(lines[meth_sig_idx])
    method_info.docstrings = extract_docstrings(lines, meth_sig_idx, next_meth_sig_idx)
    
    return method_info
        
def mock_method(one, two, three, four):
    print('vokol')

def display_module_method_info(meth_info):

    print(meth_info.method_name)
    for p in meth_info.params:
        print('  ' + p)
    for docstring in meth_info.docstrings:
        print(docstring)    
    
def main():

    text_file_path = src_file_path_from_cmdargs()
    lines = load_text_file(text_file_path)
    sig_line_idxs = get_sig_line_idxs(lines)
    
    module_methods_info = []    
    
    for i in range(len(sig_line_idxs)):
       
        idx = sig_line_idxs[i]
        
        if i < len(sig_line_idxs) - 1:
            next_idx = sig_line_idxs[i + 1]
        else:
            next_idx = len(sig_line_idxs)
        
        module_methods_info.append( get_method_info(lines, idx, next_idx) )

    for meth_info in module_methods_info:
        display_module_method_info(meth_info)
       
        
if __name__ == '__main__':
    main()

Untangling Object Dependencies in MS-SQL-08

2010-07-19T01:16:00.001-07:00

useful TechRepublic Blog

1. get a list of all system objects from sys.objects
name,object_id,parent_object_id,type

2. determine individual dependencies from sys.sql_dependencies
object_id, referenced_major_id

3. use a topological sort to untangle the list of dependencies to a simple dependency tree.

setting up iburst driver for ubuntu 8-10 intrepid ibex

2010-07-18T10:54:00.000-07:00

http://blog.hostinghabitat.com/2009/02/iburst-usb-modem-installation-tutorial.html

ibdriver (iburst driver) for ubuntu 10.04

2010-07-18T09:10:00.000-07:00

Driver for 2.6.28 kernel

Patch from 2.6.28 to 2.6.31:
option 1
option 2

yapyfin.py Python Yahoo Finance Client

2010-07-17T09:47:00.000-07:00

Yahoo Finance exposes a large amount of historical US equity data via their html api. The python code below downloads the open-high-low-close-adjclose-volume data for British Petroleum (BP) = stock ticker symbol BP, between 1900/01/01 and 2010/07/18, to text file BP.csv


import httplib
httplib.HTTPConnection.debuglevel = 1
import urllib

def enc_quote(ticker, fromY, fromM, fromD, toY, toM, toD):

    quote = dict()

    quote['s'] = ticker
    quote['a'] = fromM
    quote['b'] = fromD
    quote['c'] = fromY
    quote['d'] = toD
    quote['e'] = toM
    quote['f'] = toY
    quote['g'] = "d" 

    return urllib.urlencode(quote)
    
url_stem = 'http://ichart.yahoo.com/table.csv?'
quote_tokens = enc_quote('BP', '1900', '01', '01', '2010', '07', '18')
url = url_stem + "&ignore=.csv" + quote_tokens

f = urllib.urlopen(url)
body = f.read()
f.close()

try:
    f = open('BP.csv', 'w')
    f.write(body)
    f.close()
except Exception, err:
    print('ERROR: %s\n' % str(err))

PyMSSql - import _mssql - ImportError: DLL load failed: The specific module could not be found

2010-07-15T05:33:00.000-07:00

under windows xp pro,
When attempting to import pymssql.py,
I experienced the following error:

"
import _mssql
ImportError: DLL load failed: The specific module could not be found
"

So this is all a bit cryptic, but after googling, which suggested using a windows diagnostic tool [ProcessMonitor] to locate the failing process, it turns out that what is missing is an (accessible) copy of 'mscvr71.dll', which can be downloaded off the net, and should be copied to 'c:\windows\system32\', or 'c:\windows\system\' if running 64bit windows.

you then need to run 'regsvr32 msvcr71.dll' from the command line, in the directory that you copied the dll to.

if you get a 'cant find entrypoint' type error message, its actually still all ok, pymssql should run just fine by that point.

Matching File Extension to Applications

2010-07-13T06:10:00.001-07:00

http://filext.com/

Python Client Consumes WCF Web Service

2010-07-11T05:11:00.000-07:00

- Make a SOAP client with Python
- StackOverFlow - How can I consume a WSDL (SOAP) web service in Python?
- SourceForge - Python Web Services Project

RSA ID Number Check-Sum Algorithm

2010-07-01T07:18:00.000-07:00

infomation sourced from this site.

13 digit South African Identity Numbers have the following format


{YYMMDD}{G}{SSS}{A}{Z}

YYMMDD  Date of birth
G       Gender:  0-4 = Female, 5-9 = Male
SSS     Sequence No. for DOB/G combination.
C       Citizenship: 0 = SA, 1 = other
A       generally, but not strictly = 8, 9
Z       CheckSum Digit

Calculation of Checksum Digit = Z

A = sum of digits in odd position (excluding last checksum digit)
B = sum of all the digits of the product of 2 and the number formed from the original be removing all the odd digits
C = A + B
Z = 10 - (second digit of C)

Test Driven Python Development [link]

2010-06-13T00:21:00.000-07:00

http://www.slideshare.net/Skud/test-driven-development-tutorial

Linux Admin Blog [excellent]

2010-06-13T00:17:00.000-07:00

http://utcc.utoronto.ca/~cks/space/blog/

Unit Testing C# with NUnit

2010-05-30T00:36:00.000-07:00

MonoDevelop
http://www.dijksterhuis.org/using-nunit-with-monodevelop/

How-To Change the Names of SQL Server DB Files

2010-05-26T06:49:00.000-07:00

http://www.kodyaz.com/articles/change-sql-server-database-file-names.aspx
http://timothychenallen.blogspot.com/2007/02/sql-server-how-to-change-database-file.html

Power-Commands for Visual Studio 2008

2010-05-26T06:02:00.000-07:00

http://code.msdn.microsoft.com/PowerCommands
http://visualstudiogallery.msdn.microsoft.com/en-us/e5f41ad9-4edc-4912-bca3-91147db95b99

Decorators & OO in Python

2010-04-26T07:13:00.000-07:00

Jack Diederich
[Python-3000] PEP Draft: Class Decorators

Cesar Otero - IBM DevelopWorks White Paper
Python 3 primer, Part 2: Advanced topics
Metaclasses, decorators, and other strange creatures

Python Introspection/Reflection Utility Class

2010-04-26T02:52:00.000-07:00

So the code below is for a python module 'mir.py', and contains a class 'Mir' and a rather thin main method 'run()' which demos the class.


class Mir:
    """mirror introspection/reflection class"""

    meth_lookup_token_len = len('<function')
    meth_type_lookup = {
        '<bound me' : 'instance',
        '<function' : 'static',
        '<method-wr' : 'wrapper',
        '<built-in ' : 'built-in'
        }

    def __init__(self):
        """docstring for initializer"""
        pass
    
    @staticmethod
    def ins(target,show_magic_meths=False):
    
        lines = []
    
        """provide basic information on the target"""

        # column widthss
        c1 = 20
        c2 = 20
        c3 = 40        

        field_names = []
        method_names = []
        mangled_field_names = []

        dir_list = dir(target)
        
        for ob in dir_list:

            if (callable(getattr(target, ob))):
                method_names.append(ob)
            else:
                field_names.append(ob)

        # FIELDS --------------------------------------

        #  double leading and trailing underscore
        magic_fields = []
        # starts and ends with alphabetic
        normal_fields = []

        # double leading underscore # mangledFields = []
        # single leading underscore # privateFields = []

        for field_name in field_names:

            a = getattr(target, field_name)
            l = len(field_name)

            # magic fields
            if (field_name[0:2] == '__'):
                if (field_name[l - 2 : l] == '__'):
                    magic_fields.append(field_name)
                else:
                    mangled_field_names.append(field_names)
            else:
                normal_fields.append(field_name)

        if '__doc__' in magic_fields:
            docstring = getattr(target, '__doc__')
        else:
            docstring = 'no doc string'

        if '__module__' in magic_fields:
            moduleName = getattr(target, '__module__')
        else:
            moduleName = 'no module'

        # METHODS

        # class methods
        # instance methods
        # - constructor
        # - vanilla

        static_methods = []
        instance_methods = []

        magic_methods = []

        meth_info = []

        for method_name in method_names:
            
            # DETERMINE METHOD TYPE = INSTANCE, STATIC

            a = getattr(target, method_name)
            try:
                s = (str(a))
                token = s[0:Mir.meth_lookup_token_len+1]
                meth_type = Mir.meth_type_lookup[token]
            except:
                meth_type = s[0:c2]
            else:
                pass
            
            # GET METHOD DOC-STRING
            
            meth_docstring = getattr(a, '__doc__')

            if (meth_docstring == None):
                meth_docstring = ''
            else:
                meth_docstring = meth_docstring.replace('\n', ' | ')

            if (meth_type == 'static'):
                static_methods.append((method_name, meth_docstring))
            elif (meth_type == 'instance'):
                instance_methods.append((method_name, meth_docstring))
            else:
                pass

            L = len(method_name)
            prefix =  (method_name[0:2] == '__')
            suffix =  (method_name[L-2:L] == '__')
            if (prefix and suffix):
                magic_methods.append(method_name)

            meth_info.append((method_name, meth_type, meth_docstring))

        lines.append('----------------------------------------------------------------------')    
        lines.append('target = ' + str(target))
        lines.append('target type = ' + str(type(target)))
        lines.append('source module:  %s' % moduleName)
        lines.append('----------------------------------------------------------------------')
        lines.append('docstring:  %s' % docstring)
        lines.append('')
        lines.append('----------------------------------------------------------------------')
        lines.append('FIELDS')
        lines.append('---------------')
        # static
        # class
        # instance

        for field_name in normal_fields:
            a = getattr(target, field_name)
            lines.append(field_name.ljust(20) + str(a).ljust(30))

        if (show_magic_meths):
            lines.append('----------------------------------------------------------------------')
            lines.append('METHODS - MAGIC')
            lines.append('---------------')
            for (meth_name, meth_type, methDoc) in meth_info:
                if (meth_name in magic_methods):
                    lines.append(meth_name.ljust(c1) + meth_type.ljust(c2) + methDoc.ljust(c3))

        lines.append('----------------------------------------------------------------------')
        lines.append('METHODS - NON-MAGIC')
        lines.append('---------------')
        for (meth_name, meth_type, methDoc) in meth_info:
            if (meth_name not in magic_methods):
                lines.append(meth_name.ljust(c1) + meth_type.ljust(c2) + methDoc.ljust(c3))
        
        return lines

    @staticmethod
    def inspect(target):    
    
        lines = Mir.ins(target)            
        
        for line in lines:
            print(line)                    
                    
    @staticmethod
    def ins2f(target, fname):
        
        file = open(fname, 'w')
        for line in Mir.ins(target):
            file.write(line + '\n')
        file.close()      
    
                    
# #########################################################

def run():

    lis = []
    Mir.inspect(lis)

if __name__ == '__main__':

Some OO Concepts in Python

2010-04-25T04:24:00.000-07:00

PRIVATE VS PUBLIC

the short answer is no - in other words, this is not productively supported.

use the convention of prefixing 'would otherwise be private if the dumb language supported it' fields with an underscore, e.g.


class TheClass:

  def __init__(self):
    self._nominallyPrivateField = 'private'

CLASS vs INSTANCE OBJECTS

Class Objects support
- instantiation
- attribute referencing


class TheClass:

  classLevelField = 'class level field'

  def __init__(self):
    self.instanceLevelField = 'instance level field'

Making our descriptively named class more accurately self-referential:


class TheClass:

  classLevelField = 'class level field'

  def __init__(self):
    self._nominallyPrivateInstanceLevelField = 'only nominally private instance level field'

Finally, just to avoid any lurking confusion, THE FOLLOWING IS FLAWED


class TheClass:

  classLevelField = 'class level field'

  self._nominallyPrivateInstanceLevelField = 'only nominally private instance level field'

  def __init__(self):
    pass

and fails miserably, raising a NameError exception;


NameError: name 'self' is not defined

-------

So, annotating a method with the @classmethod produces something quite similar to a C# static method. In other words, within the class method only local and class level references are possible, or rather, no instance level field or method is accessible (short of instantiating an object of that class within the class method, and calling the method on that instance).

Where C# and python differ, however, is that in C# to call the static method DoStuff() on class TheClass, you would have something like this


TheClass.DoStuff()

In other words, you can't have something like this, where you call the class method on an instance variable


TheClass myClass = new TheClass();
myClass.DoStuff();

The compiler will kick you in the head.

In python, however, there is no such limitation. You can happily call a class method on an instance variable (the class method still won't have access to the instance level scope).

ABSTRACT BASE CLASSES & QUASI-INTERFACES
- ABCs - PEP 3119 = http://www.python.org/dev/peps/pep-3119/
- from the pythondocs: http://docs.python.org/library/abc.html
- James Tauber's take on interfaces: http://jtauber.com/blog/2007/03/04/interfaces_versus_abstract_base_classes_in_python/

To Force a Line-Break in a VS2008 Method Summary Comment

2010-04-15T06:32:00.001-07:00

enclose the target text in tags.
this will force a line-break afterwards.

note that a line with will simply be ignored, and will not produce and empty line as might be expected.

Python Resources

2010-04-10T08:03:00.000-07:00

WHAT IS PYTHON ?
- interpreted
- compiled to intermediate bytecode
- dynamically typed
- functional, object oriented and imperative paradigms

SOME PYTHON USERS
- google
- facebook ?
- nasa

A COUPLE OF NOTES ON VERSIONING
- latest release = 3.1
- 2.7 = offers features from 3.0 but and backwards compatibility with 2.x
get the latest version from the OFFICIAL DOWNLOAD PAGE

Python-specific Integrated Development Environments (IDE's)
- #1 - GEANY Light-Weight w. Introspective Predictive Text !!
- netbeans 6.5 python early-access stand-alone
- netbeans java with python plugin
- eclipse with pydev plugin
- SCITE text editor

TUTORIALS

Good places to start
- The Official Docs
- Dive into Python

STYLE GUIDEs
- PEP 8 - an Official Style Guide
- official google python style guide
- 'Coding Like a Pythonista' - Idiomatic Python

UNIT TESTING
- unittest

OBJECT ORIENTED PARADIGM
- decorators, decorators
- abstract base classes
- meta_classes
- properties, properties
- staticmethods & classmethods

WIDGET KITS
- pygtk
- wxpython
- light-weight - tkinter

WEB
- django

NUMERIC AND SCIENTIFIC LIBRARIES
- numpy and scipy

PLOTTING
- matplotlib

LOGGING and other timber-related activities

Why Python ?
by Eric S Raymond, author of 'The Cathedral and the Bazaar"

Access App.Settings Config from CLR Stored Proc

2010-03-26T02:39:00.000-07:00

The situation:

You've got a CLR stored proc deployed to a MS SQL Server 2008 DB, and you want to access a standard xml config from within the CLR stored proc (which is in turn called from within a standard stored proc)

link

DevExpress XtraGrid - Group by Column - Enable/Disable

2010-03-23T07:40:00.000-07:00

assuming you have

DevExpress.XtraGrid.GridControl gridControl;
DevExpress.XtraGrid.Views.Grid.GridView gridView;

to enable grouping capability
gridView.OptionsView.ShowGroupPanel = true

to disable
gridView.OptionsView.ShowGroupPanel = false

CLR-Excel Interop

2010-03-03T07:27:00.000-08:00

Tutorial Series

Sikorsky - the Helicopter & the Man

2010-01-23T04:46:00.000-08:00

helicopter[wikipedia]
Igor Sikorsky, father of the helicopter[wikipedia]

word frequency distribution in the king james bible - zipf's law

2010-01-10T08:10:00.000-08:00

a plain-text version of the king-james bible can be downloaded as http://patriot.net/~bmcgin/kjv12.txt .

check this python module, featuring methods that
- open the as-formatted king james, and parse it to a list of text lines
- fragment a list of text lines to a [list] sequence of words, by splitting on punctuation and white-space
- sieve a word sequence to a word frequency distribution dictionary





from time import time

def p(s):
  print(s.strip())
        
def extract_text_from_file(path):
  '''
  expects string filepath
  parse king james bible text located at file path 'path'
  strip out all info except for raw text lines, without
  verse/verse number annotations
  returns list of text lines
  '''
  book_count = 0
  line_count = 0
  text_lines = []
  try:
    f = open(path, 'r')
    completed = False
    i = 0
    start_time = time()
    line = ''
    while completed == False:
      line = f.readline()      
      i = i + 1
      if (line == None) or (line == ''):
        completed = True
        continue
      if len(line) < 8:
        continue
      # BOOK
      # Book 01 Genesis
      if line[:4] == 'Book':
        book_count += 1
        line = line.strip()
        splut = line.split('\t')
        book_num_str = splut[0].split(' ')[1]
        book_num = int(book_num_str)
        book_name = splut[1]
        continue
      # INIT VERSE LINE
      # 001:002 And the earth was without form, and void; and darkness was
      if line[3] == ':':
        verse_book_num = int(line[0:3])
        verse_num = int(line[4:7])
        text = line[8:len(line)-1]
        text_lines.append(text)
        line_count += 1
        continue
      # SUBSEQUENT VERSE LINE
      # upon the face of the deep. And the Spirit of God moved upon
      if line[:8] == '        ':
        text = line[8:len(line)-1]
        text_lines.append(text)
        line_count += 1
        continue  
    end_time = time()
    duration = end_time - start_time
    print('file load process took %s seconds' % duration)  
  finally:
    f.close()
  return text_lines   
   
def fragment_text_to_word_sequence(text):  
  '''
  expects text = list of lines of punctuated text
  returns string list corresponding to the word_sequence of the text
  '''
  word_sequence = []  
  init_punc_split_chars = [ ',', '.', '\"', ':', ';', '!', '(', ')', ' ', '?']
  start_time = time()
  for line in text:
    split_chars = init_punc_split_chars    
    current = [line]
    for split_char in split_chars:
      next = []
      for piece in current:
        for fragment in piece.split(split_char):
          if fragment != '':
            next.append(fragment)
      current = next          
    word_sequence.extend(current)
  end_time = time()
  duration = end_time - start_time
  print('split to word sequence took %s seconds' % duration)  
  return word_sequence

def build_word_dist_for_sequence(word_seq):
  '''
  construct word frequency distribution for given word sequence
  '''
  freqs = {}
  keys = []
  start_time = time()
  for word in word_seq:
    word = word.lower()
    if word in keys:
      freqs[word] += 1
    else:
      freqs[word] = 1
      keys.append(word)
  end_time = time()
  duration = end_time - start_time
  print('sieving of word sequence to frequency distribution took %s seconds' % duration)  
  return freqs

def write_word_freqs_to_disc(freqs):
  dest = open('dist.txt', 'w')
  for key,value in freqs.items():
    s = str(key) + ',' + str(value) + '\n'
    dest.write(s)
  dest.close()    
  
def main():
  path = 'z://self/data/bible_king_james_version.txt'
  text = extract_text_from_file(path)
  word_seq = fragment_text_to_word_sequence(text)
  freqs = build_word_dist_for_sequence(word_seq)
  write_word_freqs_to_disc(freqs)

if __name__ == '__main__':
  main()

the idea is to test whether Zipf's (power) law as mentioned by Benoit Mandelbrot in his 'The Misbehaviour of Markets', holds in the case of the KJV.

Zipf's Law @ Wikipedia
http://en.wikipedia.org/wiki/Zipf's_law

Zipf-Mandelbrot Law
http://en.wikipedia.org/wiki/Zipf%E2%80%93Mandelbrot_law