/log

It’s not so fancy but I love it.

For Mac OSX Install chmlib:

sudo ports install chmlib

Now you’ll find the chm_http available and you are ready to serve the documentation.

chm_http –port=8080 –bind=127.0.0.1 file.chm

aaand now browse  http://127.0.0.1:8080 and you should find the file de-compiled and served for you

Enjoy.

Piece of news: Choosing to be unemployed for the first time since years was a quite revolutionary decision but I prefer calling it an entrepreneurial decision ..
I always had the habit of binding concepts/problems/situations that i face in my daily development life to my daily life and today because I’m “relatively” more free than before, I’m going to share these”Thoughts” with you ..
simple it’s “circular dependency” problem and it’s relation to the marriage situation ..

if you don’t know what’s circular dependency you may refer to the link :
http://en.wikipedia.org/wiki/Circular_dependency

In software engineering, a circular dependency is a relation between two or more modules which either directly or indirectly depend on each other to function properly.

And in my life it’s as simple as marriage and work.
To marry you need money so you need to work ..
and to be able to excel in your work you need -specially in our job- a stable life and kind person who will make sure that your life
more important than your code lines, access modifiers, singleton etc…

In software compiler will detect it will warn you in some languages and won’t compile ..
In real life you will be going through the infinite loop simply you will be thinking of marriage and you should marry now in the depression moments of your work
and you at the other side you will be thinking of work and how is it essential to you to complete your marriage project ..

Finally -to be honest- there’s another problem here ..
problem of definition associated to that problem ..
We can give it the name of “Marriage the goal vs Marriage the tool !”

And that’s it for now ..
if you can help please, don’t hesitate to comment..

Thanks in advance

I like using yield here and I was happy when I knew that scala has yield

def oddNumbers(xlist):
	for item in xlist:
		item += 2
		xlist.append(item)
		yield item

oddNumbers 		= oddNumbers([7])
primeNumbers	= [2, 3, 5, 7]
count			= 3
summation		= 17

for item in oddNumbers:
	isPrime = True
	for otherItem in primeNumbers:
		if item % otherItem == 0 and item != otherItem:
			isPrime = False
	if isPrime:
		primeNumbers.append(item)
		count += 1
		summation += item
	if count == 999:
		break

print summation

طيب الله أوقاتكم

٣- فشل المحاولة فشل مقدرش أوصفه غير بـ “محرج” بس حاسس إني عملت اللي عليا يعني مكنش في حاجة ينفع أعملها عشان أخلي الموضوع ينجح.. وأنا بتمنالها كل خير هي حد كويس جدا جدا يعني