【源码项目】C语言编程之火车票管理系统！（最强代码）
大学计算机软件技术基础课程设计任务书
一、题目：
火车票信息管理系统；
二、目的与要求 ：
● 目的培养学生综合利用C++语言进行程序设计的能力，
● 培养学生的编程能力、用计算机解决实际问题的能力，加强对理论知识的理解和实际运用；
● 培养学生对软件工程知识和方法的初步认识，提高软件系统分析能力和程序文档建立、归纳总结的能力；
● 提高学生的实际动手能力和独立思考的能力。
最后的版本，不想更新了。更新也没有什么功能自己可以弄了。该版本修改了前几个版本中错误的地方，相对完整了许多，功能也加强了。
/*----------该程序主要实现火车票信息的管理----------*/
#include <string.h>
#include <stdio.h>
/*----------定义车次、出发站、终点站、发车时间、到达时间、票价数组----------*/
char trains[10][10], start_station[10][10], end_station[10][10], start_time[10][10], end_time[10][10];
int price[10], i = 0, j = 0, k = 0, l = 0, x = 0; /* ----------定义全局变量---------- */
void set( void );
void search( void );
void sum( void );
void sort( void );
void edit( void );
void del( void );
int main( void )
{
int o; /* ----------o在此处为选项数值---------- */
/*----------以下代码为主菜单选项----------*/
for ( o = 1; o != 0; o )
{
printf( "\n------------------------------------------------\n" );
printf( "----------欢迎使用火车票管理系统主菜单----------" );
printf( "\n------------------------------------------------\n" );
printf( " 1.set (录入)\n" );
printf( " 2.search (查询)\n" );
printf( " 3.sum (统计)\n" );
printf( " 4.sort (排序)\n" );
printf( " 5.edit (编辑)\n" );
printf( " 6.del (删除)\n" );
printf( " 0.exit (退出)\n" );
printf( "\n请输入要选择的服务项目:" );
scanf( "%d", &o );
if ( o == 1 )
set();
else if ( o == 2 )
search();
else if ( o == 3 )
sum();
else if ( o == 4 )
sort();
else if ( o == 5 )
edit();
else if ( o == 6 )
del();
else if ( o == 0 )
break;
else
printf( "\n请输入正确的数字!n\n" );
}
}
/*----------录入子函数---------*/
void set( void )
{
printf( "\n请输入准备录入的信息数:" );
scanf( "%d", &i );
if ( i <= 0 || i > 10 )
{
printf( "\n----------请正确输入1-10之间的整数!----------\n" );
return;
}
i = i + x;
for ( j = x; j < i; j++ )
{
++x; /* ----------记录录入的信息总条数---------- */
printf( "\n请输入车次:" );
scanf( "%s", &trains[j] );
printf( "\n请输入出发站:" );
scanf( "%s", &start_station[j] );
printf( "\n请输入终点站:" );
scanf( "%s", &end_station[j] );
printf( "\n请输入发车时间:" );
scanf( "%s", &start_time[j] );
printf( "\n请输入到达时间:" );
scanf( "%s", &end_time[j] );
printf( "\n请输入票价:" );
scanf( "%d", &price[j] );
}
printf( "\n----------信息录入完毕----------n\n" );
}
/*----------查询子函数----------*/
void search( void )
{
char search[10];
int search1;
k = 0;
if ( x == 0 )
{
printf( "\n----------暂无数据可查询!----------\n" );
return;
}
printf( "\n--------------------------------\n" );
printf( "----------查询功能菜单----------" );
printf( "\n--------------------------------\n" );
printf( " 1.车次\n" );
printf( " 2.出发站\n" );
printf( " 3.终点站\n" );
printf( " 4.发车时间\n" );
printf( " 5.到达时间\n" );
printf( " 6.票价\n" );
printf( "\n请输入要查询方式的编号:" );
scanf( "%d", &l );
if ( x == 0 )
{
printf( "\n----------当前数据库为空----------\n" );
}else if ( l == 1 )
{
printf( "\n请输入需要查询的车次:" );
scanf( "%s", search );
for ( i = 0; i < x; i++ )
{
j = strcmp( search, trains[i] );
if ( j == 0 )
{
++k;
if ( k == 1 )
{
printf( "\n-------------------------------------------------------------\n" );
printf( "车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n-------------------------------------------------------------\n" );
}
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------查询结束,本次共查询的%d个结果----------n\n", k );
}else if ( l == 2 )
{
printf( "\n请输入需要查询的出发站:" );
scanf( "%s", search );
for ( i = 0; i < x; i++ )
{
j = strcmp( search, start_station[i] );
if ( j == 0 )
{
++k;
if ( k == 1 )
printf( "\n车次 出发站 终点站 发车时间 到达时间 票价\n" );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------查询结束,本次共查询的%d个结果----------n\n", k );
}else if ( l == 3 )
{
printf( "\n请输入需要查询的终点站:" );
scanf( "%s", search );
for ( i = 0; i < x; i++ )
{
j = strcmp( search, end_station[i] );
if ( j == 0 )
{
++k;
if ( k == 1 )
printf( "\n车次 出发站 终点站 发车时间 到达时间 票价\n" );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------查询结束,本次共查询的%d个结果----------n\n", k );
}else if ( l == 4 )
{
printf( "\n请输入需要查询的发车时间:" );
scanf( "%s", search );
for ( i = 0; i < x; i++ )
{
j = strcmp( search, start_time[i] );
if ( j == 0 )
{
++k;
if ( k == 1 )
printf( "\n-------------------------------------------------------------\n" );
printf( "车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n-------------------------------------------------------------\n" );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------查询结束,本次共查询的%d个结果----------n\n", k );
}else if ( l == 5 )
{
printf( "\n请输入需要查询的到达时间:" );
scanf( "%s", search );
for ( i = 0; i < x; i++ )
{
j = strcmp( search, end_time[i] );
if ( j == 0 )
{
++k;
if ( k == 1 )
printf( "\n-------------------------------------------------------------\n" );
printf( "车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n-------------------------------------------------------------\n" );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------查询结束,本次共查询的%d个结果----------n\n", k );
}else if ( l == 6 )
{
printf( "\n请输入需要查询的票价:" );
scanf( "%d", &search1 );
for ( i = 0; i < x; i++ )
{
j = search1 == price[i] ? 0 : 1;
if ( j == 0 )
{
++k;
if ( k == 1 )
printf( "\n-------------------------------------------------------------\n" );
printf( "车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n-------------------------------------------------------------\n" );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------查询结束,本次共查询的%d个结果----------n\n", k );
}else
printf( "\n请正确输入排序方式编号!\n" );
}
/*----------列表子函数----------*/
void sum( void )
{
if ( x != 0 )
{
printf( "\n----------------------------------------------------------------------\n" );
printf( "编号 车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n----------------------------------------------------------------------\n" );
for ( i = 0; i < x; i++ )
{
printf( "%-8d ", i + 1 );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
printf( "\n----------共有%d条记录----------\n", x );
}
/*----------排序子函数----------*/
void sort( void )
{
char sort[1][10];
int sort1;
if ( x == 0 )
{
printf( "\n----------无数据可排序!----------\n" );
return;
}
printf( "\n--------------------------------\n" );
printf( "----------排序功能菜单----------" );
printf( "\n--------------------------------\n" );
printf( " 1.车次\n" );
printf( " 2.出发站\n" );
printf( " 3.终点站\n" );
printf( " 4.发车时间\n" );
printf( " 5.到达时间\n" );
printf( " 6.票价\n" );
printf( "\n请输入要排序的序号:" );
scanf( "%d", &k );
/*----------以下为排序工作流程----------*/
if ( k == 1 )
{
for ( i = 0; i < x; i++ )
for ( j = i; j < x - 1; j++ )
{
l = strcmp( trains[i], trains[j + 1] );
if ( l > 0 )
{
strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;
}
}
}else if ( k == 2 )
{
for ( i = 0; i < x; i++ )
for ( j = i; j < x - 1; j++ )
{
l = strcmp( start_station[i], start_station[j + 1] );
if ( l > 0 )
{
strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;
}
}
}else if ( k == 3 )
{
for ( i = 0; i < x; i++ )
for ( j = i; j < x - 1; j++ )
{
l = strcmp( end_station[i], end_station[j + 1] );
if ( l > 0 )
{
strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;
}
}
}else if ( k == 4 )
{
for ( i = 0; i < x; i++ )
for ( j = i; j < x - 1; j++ )
{
l = strcmp( start_time[i], start_time[j + 1] );
if ( l > 0 )
{
strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;
}
}
}else if ( k == 5 )
{
for ( i = 0; i < x; i++ )
for ( j = i; j < x - 1; j++ )
{
l = strcmp( end_time[i], end_time[j + 1] );
if ( l > 0 )
{
strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;
}
}
}else if ( k == 6 )
{
for ( i = 0; i < x; i++ )
for ( j = i; j < x - 1; j++ )
{
l = price[i] > price[j + 1] ? 1 : 0;
if ( l > 0 )
{
strcpy( sort[0], trains[i] );
strcpy( trains[i], trains[j + 1] );
strcpy( trains[j + 1], sort[0] );
strcpy( sort[0], start_station[i] );
strcpy( start_station[i], start_station[j + 1] );
strcpy( start_station[j + 1], sort[0] );
strcpy( sort[0], end_station[i] );
strcpy( end_station[i], end_station[j + 1] );
strcpy( end_station[j + 1], sort[0] );
strcpy( sort[0], start_time[i] );
strcpy( start_time[i], start_time[j + 1] );
strcpy( start_time[j + 1], sort[0] );
strcpy( sort[0], end_time[i] );
strcpy( end_time[i], end_time[j + 1] );
strcpy( end_time[j + 1], sort[0] );
sort1 = price[i];
price[i] = price[j + 1];
price[j + 1] = sort1;
}
}
}else
printf( "\n----------你的输入错误!----------n\n" );
/*----------排序工作流程结束----------*/
printf( "\n-------------------------------------------------------------\n" );
printf( "车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n-------------------------------------------------------------\n" );
for ( i = 0; i < x; i++ )
{
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
}
/*----------编辑子函数----------*/
void edit( void )
{
if ( x != 0 )
{
printf( "\n----------------------------------------------------------------------\n" );
printf( "编号 车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n----------------------------------------------------------------------\n" );
for ( i = 0; i < x; i++ )
{
printf( "%-8d ", i + 1 );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
printf( "\n----------------------------------\n" );
printf( "----------编辑功能主菜单----------" );
printf( "\n----------------------------------\n" );
}
if ( x == 0 )
printf( "\n----------没有数据可编辑!----------\n" );
else{
printf( "\n请输入要修改信息的编号:" );
scanf( "%d", &j );
if ( j >= 1 && j <= x )
{
printf( "\n--------------" );
printf( "\n 1.车次 " );
printf( "\n 2.出发站 " );
printf( "\n 3.终点站 " );
printf( "\n 4.发车时间 " );
printf( "\n 5.到达时间 " );
printf( "\n 6.票价 " );
printf( "\n--------------" );
printf( "\nn请输入要修改的项目:" );
scanf( "%d", &k );
if ( k == 1 || k == 2 || k == 3 || k == 4 || k == 5 || k == 6 )
{
printf( "\n请输入你要修改的数据:" );
if ( k == 1 )
{
scanf( "%s", &trains[j - 1] );
printf( "\n----------编辑操作成功----------\n" );
}else if ( k == 2 )
{
scanf( "%s", &start_station[j - 1] );
printf( "\n----------编辑操作成功----------\n" );
}else if ( k == 3 )
{
scanf( "%s", &end_station[j - 1] );
printf( "\n----------编辑操作成功----------\n" );
}else if ( k == 4 )
{
scanf( "%s", &start_time[j - 1] );
printf( "\n----------编辑操作成功----------\n" );
}else if ( k == 5 )
{
scanf( "%s", &end_time[j - 1] );
printf( "\n----------编辑操作成功----------\n" );
}else {
scanf( "%d", &price[j - 1] );
printf( "\n----------编辑操作成功----------\n" );
}
}else
printf( "\n----------请输入正确的项目!----------\n" );
}else
printf( "\n----------请输入正确的编号!----------\n" );
}
}
/*----------删除子函数----------*/
void del( void )
{
if ( x != 0 )
{
printf( "\n----------------------------------------------------------------------\n" );
printf( "编号 车次 出发站 终点站 发车时间 到达时间 票价" );
printf( "\n----------------------------------------------------------------------\n" );
for ( i = 0; i < x; i++ )
{
printf( "%-8d ", i + 1 );
printf( "%-8s ", trains[i] );
printf( "%-10s ", start_station[i] );
printf( "%-10s ", end_station[i] );
printf( "%-12s ", start_time[i] );
printf( "%-12s ", end_time[i] );
printf( "%-8d", price[i] );
printf( "\n" );
}
printf( "\n----------------------------------\n" );
printf( "----------删除功能主菜单----------" );
printf( "\n----------------------------------\n" );
printf( "\n请输入以上要删除信息的编号:" );
scanf( "%d", &j );
}
if ( x == 0 )
printf( "\n----------没有数据可删除!----------\n" );
else if ( j < x && j > 0 )
{
for (; j < x + 1; j++ )
{
strcpy( trains[j - 1], trains[j] );
strcpy( start_station[j - 1], start_station[j] );
strcpy( end_station[j - 1], end_station[j] );
strcpy( start_time[j - 1], start_time[j] );
strcpy( end_time[j - 1], end_time[j] );
price[j - 1] = price[j];
}
x = x - 1;
printf( "\n----------删除操作成功!----------\n" );
}else if ( j == x )
{
x = x - 1;
printf( "\n----------删除操作成功!----------\n" );
}else
printf( "\n----------请输入正确的编号!----------\n" );
}
效果图：
嘻嘻哒~~~
看到这里你是不是又学到了很多新知识呢~
如果你很想学编程，小编推荐我的C语言/C++编程学习基地【点击进入】！
都是学编程小伙伴们，带你入个门还是简简单单啦，一起学习，一起加油~
还有许多学习资料和视频，相信你会喜欢的！
涉及：游戏开发、常用软件开发、编程基础知识、课程设计、黑客等等......
【源码项目】C语言编程之火车票管理系统！（最强代码）的更多相关文章
- Eclipse导入Hadoop源码项目及编写Hadoop程序
一 Eclipse导入Hadoop源码项目 基本步骤: 1)在Eclipse新建一个java项目[hadoop-1.2.1] 2)将Hadoop压缩包解压目录src下的core,hdfs,mapred ...
- Hadoop1.x目录结构及Eclipse导入Hadoop源码项目
这是解压hadoop后,hadoop-1.2.1目录 各目录结构及说明: Eclipse导入Hadoop源码项目: 注意:如果没有ant的包可以去网上下,不是hadoop里面的. 然后如果通过以上还报 ...
- FFmpeg源码简单分析：结构体成员管理系统-AVOption
===================================================== FFmpeg的库函数源码分析文章列表: [架构图] FFmpeg源码结构图 - 解码 FFm ...
- HashMap源码深度剖析，手把手带你分析每一行代码，包会！！！
HashMap源码深度剖析,手把手带你分析每一行代码! 在前面的两篇文章哈希表的原理和200行代码带你写自己的HashMap(如果你阅读这篇文章感觉有点困难,可以先阅读这两篇文章)当中我们仔细谈到了哈 ...
- STL源码--iterator和traits编程技法
第一部分 iterator学习 STL iterators定义: 提供一种方法,使之能够依序巡访某个聚合物(容器)所含的各个元素,而又无需暴露该聚合物的内部表达方式. 任何iteartor都应该提供5 ...
- Muzei Live Wallpaper壁纸应用安卓源码项目
这个刚刚在安卓教程网那里看到的,这个是Muzei Live Wallpaper壁纸应用源码,这是已经在Playstore上线了的android壁纸应用,点击壁纸界面可以磨砂透明效果以及一般背景效果之间 ...
- 安装Hadoop系列 — 导入Hadoop源码项目
将Hadoop源码导入Eclipse有个最大好处就是通过 "ctrl + shift + r" 可以快速打开Hadoop源码文件. 第一步:在Eclipse新建一个Java项目,h ...
- android 近百个源码项目【转】
http://www.cnblogs.com/helloandroid/articles/2385358.html Android开发又将带来新一轮热潮,很多开发者都投入到这个浪潮中去了,创造了许许多 ...
- spring5.0源码项目搭建
一.准备相应环境以及下载spring项目 Ps:此处只讲解安装gradle 1.JDK安装 2.Idea安装 3.gradle安装 Gradle下载路径:https://services.gradle ...
随机推荐
- JQuery的Ajax实现注册检测用户名
Ajax(无需等待直接向服务器发起请求) (Asynchronous Javascript And Xml) :异步的 Google创新的一种js技术 实现方法一:比较原始没有封装的方法: //核对用 ...
- linux基础命令一、
命令格式: 命令 -选项 参数 uname -r 查看内核版本 uname -m 查看系统版本 alias 别名. 举例: alias grep ='grep --color=auto' ...
- [Spark]Spark、Yarn 入门
Spark在集群上的运行模式 链接: http://spark.apache.org/docs/latest/cluster-overview.html Component章节 总结: 1 Each ...
- Educational Codeforces Round 95（A-C题解)
A. Buying Torches 题目:http://codeforces.com/contest/1418/problem/A 题解:计算一个公式:1+n*(x-1)=(y+1)*k,求满足该条件 ...
- python函数小案例
python函数 目录 python函数 1.写一个函数求三个数的和,并返回结果 2.写一个函数,求平均值,并返回结果 写一个函数,求每个数与平均值之间的差,并放回结果 1.写一个函数求三个数的和,并 ...
- DataStax Bulk Loader教程（一）
DataStax Bulk Loader - dsbulk是在DSE 6 引入的一种新的批量加载方法.(点击这里下载DataStax Bulk Loader). 它提供了将数据加载(load)到Dat ...
- 解决spark streaming集成kafka时只能读topic的其中一个分区数据的问题
1. 问题描述 我创建了一个名称为myTest的topic,该topic有三个分区,在我的应用中spark streaming以direct方式连接kakfa,但是发现只能消费一个分区的数据,多次更换 ...
- 福利来了~Linux一键部署包，环境安装不用愁！！！
前言 昨天一哥们的弟弟突然问我有没有部署过的Linux,公司连个运维都没有,服务器都要后端部署.... 你有没有相似的遭遇呢?公司规模小,后端即是运维,一份工资干两份活,哈哈~ 为了解决这老弟的困惑, ...
- RXJAVA之Subject
RxJava中常见的Subject有4种,分别是 AsyncSubject. BehaviorSubject.PublishSubject. ReplaySubject. AsyncSubject 使 ...
- vue单页面条件下添加类似浏览器的标签页切换功能
在用vue开发的时候,单页面应用程序,而又有标签页这种需求,各种方式实现不了, 从这个 到这个,然后再返回上面那个 因为每个标签页的route不一样,导致组件重新渲染的问题,怎么都不知道如何实现... ...