gagliotti

#include <unistd.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <iostream>
#include <cassert>
#include <csignal>

void produtorFunc(pid_t pid);
void consumidorFunc(int sig);

gagliotti

#include <unistd.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <iostream>
#include <cassert>
#include <csignal>
#include <chrono>
#include <ctime>

void produtorFunc(pid_t pid)

gagliotti

#include <sys/socket.h>
#include <netinet/in.h>
#include <errno.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <unistd.h>

int main(int argc, char *argv[])
{

gagliotti

#include <fstream>

int main() {
    std::fstream file;
    file.open("meuArquivo.txt", std::ios::out | std::ios::app);
}

gagliotti

#include "gtest/gtest.h"
#include "NodoAVL.h"
#include <mutex>

//std::mutex g_singleThread;

TEST(ArvoreAVLTest, RotacaoDireitaSimples){
    int e1 = 1;
    int e2 = 2;
    int e3 = 3;

gagliotti

#include "gtest/gtest.h"
#include "Nodo.h"
#include <mutex>

//std::mutex g_singleThread;

TEST(ArvoreBinariaBuscaTest,PreOrdem){
    int e2 = 2;
    int e3 = 3;
    int e4 = 4;

gagliotti

#include "gtest/gtest.h"
#include "AbstractSort.h"
#include <mutex>

//std::mutex g_singleThread;

TEST(HeapSortTest,MelhorCaso){
	Elemento e0, e1, e2;
  e0._chave = 0;
  e1._chave = 1;

gagliotti

#include "gtest/gtest.h"
#include "AbstractSort.h"
#include <mutex>

//std::mutex g_singleThread;


TEST(InsertionSortTest,MelhorCaso){
	Elemento e0, e1, e2;
  e0._chave = 0;

gagliotti

#include "gtest/gtest.h"
#include "AbstractSort.h"
#include <mutex>

//std::mutex g_singleThread;

TEST(SelectionSortTest,MelhorCaso){
	Elemento e0, e1, e2;
  e0._chave = 0;
  e1._chave = 1;

gagliotti

#include "gtest/gtest.h"
#include "Fila.h"

//extern "C" {
//#include "stack.h"
//}

TEST(FilaTest,Init){
	Fila* p = iniciaFila();
	ASSERT_NE(p,nullptr);