public override bool Equals(object obj)
{
if (obj == null)
{
return(false);
}
Polinom p = obj as Polinom;
if (p as Polinom == null)
{
return(false);
}
if (Coefficiencts.Count != p.Coefficiencts.Count)
{
return(false);
}
foreach (var key in Coefficiencts.Keys)
{
if (!p.Coefficiencts.ContainsKey(key))
{
return(false);
}
}
return(true);
}
public static Polinom operator -(Polinom p1, Polinom p2)
{
if (p1.Coefficiencts.Count == 0 && p2.Coefficiencts.Count != 0)
{
for (var i = 0; i < p2.Coefficiencts.Count; i++)
{
p2.Coefficiencts[i] = -p2.Coefficiencts[i];
}
return(p2);
}
else if (p1.Coefficiencts.Count != 0 && p2.Coefficiencts.Count == 0)
{
return(p1);
}
else if (p1.Coefficiencts.Count == 0 && p2.Coefficiencts.Count == 0)
{
return(p1);
}
if (p1.Coefficiencts.Keys.Min() < 0 || p2.Coefficiencts.Keys.Min() < 0)
{
throw new ArgumentException("Keys must be positive or zero");
}
var p3 = new Polinom()
{
Coefficiencts = new Dictionary <int, double>()
};
foreach (var key in p1.Coefficiencts.Keys)
{
if (p3.Coefficiencts.ContainsKey(key))
{
p3.Coefficiencts[key] -= p1.Coefficiencts[key];
}
else
{
p3.Coefficiencts.Add(key, p1.Coefficiencts[key]);
}
}
foreach (var key in p2.Coefficiencts.Keys)
{
if (p3.Coefficiencts.ContainsKey(key))
{
p3.Coefficiencts[key] -= p2.Coefficiencts[key];
}
else
{
p3.Coefficiencts.Add(key, -p2.Coefficiencts[key]);
}
}
return(RemoveZeroElements(p3));
}
private static Polinom RemoveZeroElements(Polinom p)
{
var count = p.Coefficiencts.Count;
for (var i = 0; i < count; i++)
{
if (p.Coefficiencts.ContainsKey(i) && p.Coefficiencts[i] == 0)
{
p.Coefficiencts.Remove(i);
}
}
return(p);
}
public static Polinom operator *(Polinom p1, Polinom p2)
{
if (p1.Coefficiencts.Count == 0 || p2.Coefficiencts.Count == 0)
{
return new Polinom()
{
Coefficiencts = new Dictionary <int, double>()
}
}
;
if (p1.Coefficiencts.Keys.Min() < 0 || p2.Coefficiencts.Keys.Min() < 0)
{
throw new ArgumentException("Keys must be positive or zero");
}
var p3 = new Polinom()
{
Coefficiencts = new Dictionary <int, double>()
};
foreach (var key1 in p1.Coefficiencts.Keys)
{
foreach (var key2 in p2.Coefficiencts.Keys)
{
if (p3.Coefficiencts.ContainsKey(key1 + key2))
{
p3.Coefficiencts[key1 + key2] += p1.Coefficiencts[key1] * p2.Coefficiencts[key2];
}
else
{
p3.Coefficiencts.Add(key1 + key2, p1.Coefficiencts[key1] * p2.Coefficiencts[key2]);
}
}
}
return(RemoveZeroElements(p3));
}
/// <summary>
///
/// </summary>
/// <param name="p1">Делимое</param>
/// <param name="p2">Делитель</param>
/// <returns>Частное</returns>
public static Polinom operator /(Polinom p1, Polinom p2)
{
if (p2.Coefficiencts.Count == 0)
{
throw new ArgumentException("division by zero");
}
if (p1.Coefficiencts.Count == 0)
{
return new Polinom()
{
Coefficiencts = new Dictionary <int, double>()
}
}
;
if (p1.Coefficiencts.Keys.Min() < 0 || p2.Coefficiencts.Keys.Min() < 0)
{
throw new ArgumentException("Keys must be positive or zero");
}
if (p1.Coefficiencts.Keys.Max() < p2.Coefficiencts.Keys.Max())
{
throw new ArgumentException("The degree of the divisor must be less than or equal to the degree of the dividend");
}
var listOfKeys = p1.Coefficiencts.Keys.ToList();
listOfKeys.Sort();//список ключей, отсортированный по убыванию (должен быть!)
listOfKeys.Reverse();
var res = p1;//результат деления на каждом шаге (после окончания деления это остаток)
Polinom quotient = new Polinom()
{
Coefficiencts = new Dictionary <int, double>()
}; //частное
//quotient.Coefficiencts.Add(p2.Coefficiencts.Keys.Max(), p2.Coefficiencts[p2.Coefficiencts.Keys.Max()]);//первый член частного
var key = p1.Coefficiencts.Keys.Max() - p2.Coefficiencts.Keys.Max();
var value = p1.Coefficiencts[p1.Coefficiencts.Keys.Max()] / p2.Coefficiencts[p2.Coefficiencts.Keys.Max()];
quotient.Coefficiencts.Add(key, value); //первый член частного
var subtrahend = quotient * p2; //вычитаемое
var tempPol = new Polinom()
{
Coefficiencts = new Dictionary <int, double>()
}; //член, который умножаем на делитель
for (var i = listOfKeys[1]; i >= 0; i--)
{
res = res - subtrahend;
if (res.Coefficiencts.Count == 0 || res.Coefficiencts.Keys.Max() < p2.Coefficiencts.Keys.Max())
{
break;
}
//res.Coefficiencts.Add(i,p1.Coefficiencts[i]);//сносим следующий член
var key1 = res.Coefficiencts.Keys.Max() - p2.Coefficiencts.Keys.Max();
var value1 = res.Coefficiencts[res.Coefficiencts.Keys.Max()] / p2.Coefficiencts[p2.Coefficiencts.Keys.Max()];
quotient.Coefficiencts.Add(key1, value1);//второй член частного
tempPol.Coefficiencts.Add(quotient.Coefficiencts.ElementAt(quotient.Coefficiencts.Count - 1).Key,
quotient.Coefficiencts.ElementAt(quotient.Coefficiencts.Count - 1).Value);
subtrahend = tempPol * p2;
tempPol.Coefficiencts.Clear();
}//добавить вывод и проверку остатка
return(RemoveZeroElements(quotient));
}
}
