SegFaulty's Profile User Rating: -----

SegFaulty's Photo
Reputation: 13 Tradesman
Group:
Contributors
Active Posts:
31 (0.03 per day)
Joined:
11-October 10
Profile Views:
1,632
Last Active:
User is offline Feb 27 2013 10:16 AM
Currently:
Offline

Previous Fields

Country:
US
OS Preference:
Who Cares
Favorite Browser:
Who Cares
Favorite Processor:
Who Cares
Favorite Gaming Platform:
Who Cares
Your Car:
Who Cares
Dream Kudos:
50
Icon   SegFaulty has not set their status

  1. Awards
  2. About Me
  3. Blog

Posts I've Made

  1. In Topic: PYQT4 Python problem with buttons

    Posted 26 Feb 2013

    Could you please post the ui_designer code as well? It could possibly be a problem in there.

  2. In Topic: learning and developing GUI in python - PyQT

    Posted 22 Feb 2013

    If you aren't a company looking to use Qt to produce an application that you will be selling than you really don't need to worry about the licensing, to be honest.

    This link will take you to the licensing page. It explains whether or not you really need the license.

  3. In Topic: What is Python best suited for?

    Posted 29 Oct 2012

    As Tayacan said, you can use it for large projects as well as small projects. In fact, there's a few programs for the Linux Desktop Environment GNOME that are written in Python that are quite large.

  4. In Topic: [Help] How do you write superscript?

    Posted 23 Oct 2012

    Are you needing to print superscript for math? Because if you are having issues using the unicode you could also print out x^2 as well.

  5. In Topic: Playing with Python - recursion

    Posted 17 Oct 2012

    Well, you could make a base case so that the first thing that you check is if position is larger than the length of the lists and return True if that's the case. In code this looks like:
    def isListEqual(lstOne, lstTwo, position):
    if len(lstOne) != len(lstTwo):
        return False
   
    if len(lstOne) == position:
        return True

    if lstOne[position] == lstTwo[position]:
        return isListEqual(lstOne, lstTwo, position+1)


    This isn't necessarily the cleanest recursion code, but it works.

My Information

Member Title:
New D.I.C Head
Age:
Age Unknown
Birthday:
Birthday Unknown
Gender:
Programming Languages:
Java, C++

Contact Information

E-mail:
Private

Friends

SegFaulty hasn't added any friends yet.

Comments

SegFaulty has no profile comments yet. Why not say hello?