-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
1bb1ad4
commit cb85ff5
Showing
7 changed files
with
414 additions
and
341 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,16 @@ | ||
make: exec | ||
|
||
main.o: main.cpp main.h | ||
g++ -c -o main.o main.cpp | ||
linar.o: linar.cpp | ||
g++ -c -o linar.o linar.cpp | ||
fours.o: fours.cpp | ||
g++ -c -o fours.o fours.cpp | ||
numsys.o: numsys.cpp | ||
g++ -c -o numsys.o numsys.cpp | ||
|
||
MathCalc.exe: main.o linar.o fours.o numsys.o | ||
g++ -o MathCalc.exe main.o linar.o fours.o numsys.o | ||
|
||
exec: MathCalc.exe | ||
./MathCalc.exe |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,12 +1,37 @@ | ||
#Mathcal | ||
*所有代码在g++下编译通过。 | ||
*有任何问题请联系chestnutheng@gmail.com | ||
|
||
|
||
计划功能(√已经实现 - 开发中 ×未实现) | ||
*矩阵的加减乘幂运算 √ | ||
*矩阵的行列式求值 - | ||
*复杂表达式的运算 × | ||
*进制转换 - | ||
|
||
*图形界面 | ||
##Multicalc | ||
|
||
###简介 | ||
一个表达式计算器.支持基本的运算和线性代数计算. | ||
有任何问题请联系ChestnutHeng@gmail.com. | ||
|
||
###功能介绍 | ||
|
||
- [x] 线性代数计算 | ||
- [x] 矩阵加减法 | ||
- [x] 矩阵乘法 | ||
- [x] 矩阵的幂 | ||
- [ ] 矩阵的行列式的值 | ||
- [ ] 矩阵的上三角形化简 | ||
- [ ] 矩阵的逆序数 | ||
- [ ] 矩阵的逆 | ||
- [ ] 矩阵的伴随矩阵 | ||
- [ ] 矩阵的秩 | ||
- [x] 进制转换 | ||
- [x] R1 转换为 R2 | ||
- [ ] 表达式计算 | ||
- [ ] 四则运算 | ||
- [ ] 乘方运算 | ||
- [ ] 对数函数 | ||
- [ ] 开方运算 | ||
|
||
###版本历史 | ||
> * Ver 1.0 封装了线性代数模块和矩阵类 | ||
* Ver 1.1 完善了矩阵的加减法 | ||
* Ver 1.2 完善矩阵的乘法运算和幂运算 | ||
* Ver 1.3 添加进制转换系统 | ||
|
||
|
||
> * Ver 2.0 重构了部分方法和文件结构 | ||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,44 +1,48 @@ | ||
#include <iostream> | ||
#include <stdio.h> | ||
#include <string> | ||
void fourr() | ||
{ | ||
/ | ||
|
||
} | ||
double fourans(double a, double b,string str) | ||
{ | ||
char ch = str.at(0); | ||
switch(ch) | ||
{ | ||
case '+': | ||
return a+b; | ||
case '-': | ||
return a-b; | ||
case '*': | ||
return a*b; | ||
case '/': | ||
return a/b; | ||
|
||
} | ||
return 1; | ||
} | ||
|
||
int stringconvert(string str) | ||
{ | ||
|
||
bool str1over = false; | ||
for(unsigned int i = 0;i < str.length(); ++i) | ||
{ | ||
if(str1over == false || 0 <= str[i] || str[i] <= 9 || str[i] == '.' || str[i] == 'E') | ||
str1 += str[i]; | ||
else if (0 > str[i] || str[i] > 9 || str[i] != '.' || str[i] != 'E') | ||
{ | ||
str2 += str[i]; | ||
str1over = true; | ||
} | ||
else str3 += str[i]; | ||
|
||
} | ||
return 0; | ||
#include <iostream> | ||
#include <cstdio> | ||
#include <string> | ||
|
||
using namespace std; | ||
string str1,str2,str3; | ||
|
||
void fourr() | ||
{ | ||
// | ||
|
||
} | ||
double fourans(double a, double b,string str) | ||
{ | ||
char ch = str.at(0); | ||
switch(ch) | ||
{ | ||
case '+': | ||
return a+b; | ||
case '-': | ||
return a-b; | ||
case '*': | ||
return a*b; | ||
case '/': | ||
return a/b; | ||
|
||
} | ||
return 1; | ||
} | ||
|
||
int stringconvert(string str) | ||
{ | ||
|
||
bool str1over = false; | ||
for(unsigned int i = 0;i < str.length(); ++i) | ||
{ | ||
if(str1over == false || 0 <= str[i] || str[i] <= 9 || str[i] == '.' || str[i] == 'E') | ||
str1 += str[i]; | ||
else if (0 > str[i] || str[i] > 9 || str[i] != '.' || str[i] != 'E') | ||
{ | ||
str2 += str[i]; | ||
str1over = true; | ||
} | ||
else str3 += str[i]; | ||
|
||
} | ||
return 0; | ||
} |
Oops, something went wrong.