Skip to content

Instantly share code, notes, and snippets.

View kendhia's full-sized avatar
💭
Loading...

Dhia Kennouche kendhia

💭
Loading...
View GitHub Profile
@XFAIL
def test_issue_860 ( ) :
e = x*y
assert e.subs(x, Matrix([3, 5, 3])) == Matrix([3, 5, 3])*y
@kendhia
kendhia / @XFAIL TEST
Created December 28, 2011 14:08
Issue 1756 sympy
@XFAIL
def test_issue():
assert 1/g(x) = O(1/f(x))
@kendhia
kendhia / test_issue_1180
Created December 28, 2011 14:06
Issue 1180 sympy
@XFAIL
def test_issue_1180():
var("a b")
assert O(1,a,b)+O(a+b,a,b) == O(a+b,a,b)+O(1,a,b)
@kendhia
kendhia / @XFAIL TEST
Created December 28, 2011 14:11
Issue 2069 sympy
@XFAIL
def teszt_issue_2069():
assert classify_ode(diff(v(r),r) + 2*k/r*v(r) + y, v(r)) == classify_ode(diff(v(r), r) + 2*k/r*v(r) + v(r))
@kendhia
kendhia / @XFAIL TEST
Created December 28, 2011 14:14
Issue 2453 sympy
@XFAIL
def test_issue_2453():
assert abs(sympy.I * sympy.pi) == pi
@kendhia
kendhia / @XFAIL TEST
Created December 28, 2011 14:15
Issue 2678 sympy
@XFAIL
def test_issue_2678():
b = Eq(x2(t).diff(t), x1(t) - 3*x2(t))
assert solve(b, x2(t)) == (x1 - x2(t).diff(t))/3
@kendhia
kendhia / SahanaEden bugs
Created December 31, 2011 21:48
fix issue 1059
//I mad changes in line 34 ("layout.html")
< div { direction: rtl; }
---
> div { direction: ltr; }
@kendhia
kendhia / LICENSE.txt
Created February 18, 2012 21:08 — forked from 140bytes/LICENSE.txt
140byt.es -- Click ↑↑ fork ↑↑ to play!
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2011 YOUR_NAME_HERE <YOUR_URL_HERE>
Everyone is permitted to copy and distribute verbatim or modified
copies of this license document, and changing it is allowed as long
as the name is changed.
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
@kendhia
kendhia / Find the sum of all the multiples of 3 or 5 below 1000
Created February 20, 2012 17:03
The solution of the first problem in "Project Euler" using JavaScript !
var max = 1000;
var result = 0;
function TheSum() {
for (i = 0; i<max; i++) {
if (i % 3 === 0 || i % 5 === 0) {
result += i;
console.log(result) ;
}
}
@kendhia
kendhia / Binary Tree Level Order Traversal -Java-
Created January 23, 2016 11:12
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7},
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {