repo_name stringlengths 5 122 | path stringlengths 3 232 | text stringlengths 6 1.05M |
|---|---|---|
vinayakgupta05/File-System | cmpsc473-filesys.h | <reponame>vinayakgupta05/File-System
/**********************************************************************
File : cmpsc473-filesys.h
Description : This file contains the file system prototypes
***********************************************************************/
/*******************************... |
vinayakgupta05/File-System | cmpsc473-list.c |
/**********************************************************************
File : cmpsc473-list.c
Description : File for the list management functions
***********************************************************************/
/**********************************************************************
Copyr... |
vinayakgupta05/File-System | cmpsc473-util.h | #ifndef CMPSC473_UTIL_INCLUDED
/**********************************************************************
File : cmpsc473-util.h
Description : It contains the functional prototypes for the
needed applications.
***********************************************************************/... |
vinayakgupta05/File-System | cmpsc473-disk.c |
/**********************************************************************
File : cmpsc473-disk.c
Description : File system function implementations
(see .h for applications)
***********************************************************************/
/**********************************... |
vinayakgupta05/File-System | cmpsc473-filesys.c | /**********************************************************************
File : cmpsc473-filesys.c
Description : File system function implementations
(see .h for applications)
***********************************************************************/
/********************************... |
vinayakgupta05/File-System | cmpsc473-util.c |
/**********************************************************************
File : cmpsc473-util.c
Description : This is a set of utility functiosn for the CMPSC473
projects. (see .h for applications)
***********************************************************************/
/*********... |
vinayakgupta05/File-System | cmpsc473-disk.h | <gh_stars>1-10
/**********************************************************************
File : cmpsc473-disk.h
Description : This file contains the file system prototypes
***********************************************************************/
/*******************************************************... |
vinayakgupta05/File-System | cmpsc473-p4.c | <reponame>vinayakgupta05/File-System
/**********************************************************************
File : cmpsc473-p4.c
Description : This is the main file for the file system project
(see .h for applications)
************************************************************... |
vinayakgupta05/File-System | testing-xattr.c | <gh_stars>1-10
dxattr_t *dxattr;
int i, dxattr_offset = 0;
dblock_t *dblk;
xcb_t *xcb;
fcb_t *fcb;
unsigned int block;
int num_xattrs = 0;
int tot_size_names = 0;
fcb = fs->proc->fstat_table[fd]->file->diskfile;
block = fcb->attr_block;
if(block != BLK_INVALID)
{
dblk = (dblock_t *)disk2addr( fs->base, (block2... |
vinayakgupta05/File-System | cmpsc473-list.h | <reponame>vinayakgupta05/File-System
/**********************************************************************
File : cmpsc473-list.h
Description : This file contains the list prototypes
***********************************************************************/
/****************************************... |
riversea2015/podTestLibrary | podTestLibrary/Classes/RSImageGenerator/RS_QRImageGenerator.h | <filename>podTestLibrary/Classes/RSImageGenerator/RS_QRImageGenerator.h
//
// RS_QRImageGenerator.h
// Demo_All
//
// Created by hehai on 26/07/2017.
// Copyright © 2017 hehai. All rights reserved.
//
#import <Foundation/Foundation.h>
#import <UIKit/UIKit.h>
@interface RS_QRImageGenerator : NSObject
@end
|
riversea2015/podTestLibrary | podTestLibrary/Classes/CommonTools/CommonTools.h | <gh_stars>0
//
// CommonTools.h
// Demo_All
//
// Created by hehai on 05/01/2018.
// Copyright © 2018 hehai. All rights reserved.
//
#import <Foundation/Foundation.h>
@interface CommonTools : NSObject
@end
|
riversea2015/podTestLibrary | podTestLibrary/Classes/DataModel/DataModel.h | //
// DataModel.h
// Demo_All
//
// Created by hehai on 05/01/2018.
// Copyright © 2018 hehai. All rights reserved.
//
#import <Foundation/Foundation.h>
@interface DataModel : NSObject
@end
|
riversea2015/podTestLibrary | podTestLibrary/Classes/NetStatus/RSNetStatusManager.h | <filename>podTestLibrary/Classes/NetStatus/RSNetStatusManager.h
//
// RSNetStatusManager.h
// Demo_All
//
// Created by hehai on 02/11/2017.
// Copyright © 2017 hehai. All rights reserved.
//
#import <Foundation/Foundation.h>
@interface RSNetStatusManager : NSObject
+ (void)daYinTest;
@end
|
riversea2015/podTestLibrary | Example/podTestLibrary/HHViewController.h | //
// HHViewController.h
// podTestLibrary
//
// Created by hehai on 01/05/2018.
// Copyright (c) 2018 hehai. All rights reserved.
//
@import UIKit;
@interface HHViewController : UIViewController
@end
|
feibaichen/CFCoverFlowView-Demo | CFCoverFlowViewDemo/CFViewController.h | <filename>CFCoverFlowViewDemo/CFViewController.h<gh_stars>0
//
// CFViewController.h
// CFCoverFlowViewDemo
//
// Created by c0ming on 14-5-30.
// Copyright (c) 2014年 c0ming. All rights reserved.
//
#import <UIKit/UIKit.h>
@class CFCoverFlowView;
@interface CFViewController : UIViewController
@property (weak, n... |
feibaichen/CFCoverFlowView-Demo | CFCoverFlowViewDemo/CFAppDelegate.h | <reponame>feibaichen/CFCoverFlowView-Demo
//
// CFAppDelegate.h
// CFCoverFlowViewDemo
//
// Created by c0ming on 14-5-30.
// Copyright (c) 2014年 c0ming. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface CFAppDelegate : UIResponder <UIApplicationDelegate>
@property (strong, nonatomic) UIWindow *window;
... |
feibaichen/CFCoverFlowView-Demo | CFCoverFlowView/CFCoverFlowView.h | <filename>CFCoverFlowView/CFCoverFlowView.h<gh_stars>1-10
//
// CFCoverFlowView.h
// CFCoverFlowViewDemo
//
// Created by c0ming on 14-7-6.
// Copyright (c) 2014 c0ming. All rights reserved.
//
#import <UIKit/UIKit.h>
@class CFCoverFlowView;
@protocol CFCoverFlowViewDelegate <NSObject>
@optional
- (void)coverFlo... |
joeghodsi/interview-questions | cracking-the-coding-interview/ch1-arrays-and-strings/1.2-reverse-string.c | /*
Problem: In C or C++ write a function that reverses a null-terminated string
Solution: inc from start, dec from end. swap at each step
- linear time, constant space
total time: 46
mistakes:
- didn't deal with NULL edge case
struggles:
- char*:
- was passing "..." to function rather than setting... |
joeghodsi/interview-questions | cracking-the-coding-interview/ch1-arrays-and-strings/1.4-replace-spaces-in-string.c | <gh_stars>1-10
/*
Problem: replace all spaces in a string with '%20'. May assume string has sufficient space. You are
given true length of the string
Solution: maintain copy of original and iterate over it moving values into string based on an offset
which is increased as spaces are found
- linear time, lin... |
WeiChienHsu/CS261 | midterm/DynArrBinarySearch.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include "DynArr.h"
struct DynArr
{
TYPE *data; /* pointer to the data array */
int size; /* Number of elements in the array */
int capacity; /* capacity ofthe array */
};
int _binarySearch(TYPE *data, int size, TYPE testValue) {
int low = 0;
int hig... |
WeiChienHsu/CS261 | week1/test.c | #include<stdio.h>
void foo(int x) {
printf("Foo got %d\n", x);
}
int main(int argc, char** argv) {
foo(2);
} |
WeiChienHsu/CS261 | Assignment3/Assignment_3_Instructions_SU18/Stack_from_Queues/stack_from_queue.c | <reponame>WeiChienHsu/CS261
/* CS261- Assignment 3 Part 3
* Date: 07/16/2018
* Name: <NAME>
* Email: <EMAIL>
* Linked List Stack Implementation using two Queue
* Use Two Queues (Recorded Queue and Helper Queue):
*
* queueStackPush: When push a new Queue, use one of them to record the order.
*
* queueStackTop... |
WeiChienHsu/CS261 | midterm/LinkedListQueue.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
struct Link {
int value;
struct Link *next;
};
struct LinkedListQueue {
struct Link *firstLink;
struct Link *lastLink;
};
void LinkedListQueueInit(struct LinkedListQueue *q) {
struct Link *lnk = malloc(sizeof(struct Link));
assert(lnk != 0);
ln... |
WeiChienHsu/CS261 | midterm/DynArrIterator.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include "DynArr.h"
struct DynArr
{
TYPE *data; /* pointer to the data array */
int size; /* Number of elements in the array */
int capacity; /* capacity ofthe array */
};
struct dynArrIterator {
struct DynArr *da;
int currentIndex;
};
void dynArr... |
WeiChienHsu/CS261 | final/Heap.c | <filename>final/Heap.c
TYPE dyArrayGet(DyArray *heap, int index);
void dyArrayPut(DyArray *heap, int index, int value);
void dyArrayAdd(DyArray *heap, int newValue);
void dyArrayRemoveAt(DyArray *heap, int index);
int dyArraySize(DyArray *heap);
void adjustHeap(struct DyArray *heap, int max, int pos) {
int leftChil... |
WeiChienHsu/CS261 | midterm/LinkedListIterator.c | <gh_stars>1-10
#include "LinkedList.h"
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
// Double link
struct Link
{
TYPE value;
struct Link* next;
struct Link* prev;
};
// Double linked list with front and back sentinels
struct LinkedList
{
int size;
struct Link* frontSentinel;
struct Link* backSenti... |
WeiChienHsu/CS261 | Assignment4/Assignment_4_Files/compare.c | <filename>Assignment4/Assignment_4_Files/compare.c
#include <stdio.h>
#include <assert.h>
#include "bst.h"
#include "structs.h"
/*----------------------------------------------------------------------------
very similar to the compareTo method in java or the strcmp function in c. it
returns an integer to tell you if... |
WeiChienHsu/CS261 | Assignment5/Programming_Assignment5_skeleton_files_SU18/spellChecker.c | /*
* CS 261 Data Structures
* Assignment 5
* Name: <NAME>
* Date: 8/02/2018
*/
#include "hashMap.h"
#include <assert.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
/**
* Allocates a string for the next word in the file and returns it. This stri... |
WeiChienHsu/CS261 | Assignment3/Assignment_3_Instructions_SU18/LLDeque/linkedList.c | /* CS261- Assignment 3 Part 1 */
/* Name: <NAME>
* Date: 07/16/2018
* Solution description:
* Linked Lust Deque and Bag Implementation.
*/
#include "linkedList.h"
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
// Double link
struct Link
{
TYPE value;
struct Link* next;
struct Link* prev;
};
// D... |
WeiChienHsu/CS261 | midterm/dfs.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include "LinkListStack.c"
int main() {
struct LinkedListStack *stack;
LinkedListStackInit(stack);
LinkedListStackFree(stack);
return 0;
} |
WeiChienHsu/CS261 | Assignment1/Q3.c | <filename>Assignment1/Q3.c
/* CS261- Assignment 1 - Q.3*/
/* Name: <NAME>
* Date: 07/01/2018
* Solution description:
* Write a function void camelCase(char* word) where the argument of the function is a string that
* must consist of two or more words separated by one or more underscores such as “random_word” or
... |
WeiChienHsu/CS261 | final/HashTableChaining.c | <reponame>WeiChienHsu/CS261<filename>final/HashTableChaining.c
struct hlink {
TYPE value;
struct hlink *next;
}
struct HashTable {
struct hlink **table;
int tableSize;
int count;
}
void initHashTable(struct HashTable *ht, int size) {
assert(size > 0);
/* Allocate a memory space for size * pointers */
... |
WeiChienHsu/CS261 | Assignment2/assignment2_Skeleton_Code/stackapp.c | <reponame>WeiChienHsu/CS261
/* CS261- Assignment 2 */
/* Name: <NAME>
* Date: 07/15/2018
* Application of the Stack - Checking balanced paretheses, braces, and brackets
* Solution description:
* char nextChar(char *s) : return the next character or '\0' if at the end of string
* int isBalanced(char *s) : re... |
WeiChienHsu/CS261 | midterm/LinkedList.c |
#include "LinkedList.h"
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
// Double link
struct Link
{
TYPE value;
struct Link* next;
struct Link* prev;
};
// Double linked list with front and back sentinels
struct LinkedList
{
int size;
struct Link* frontSentinel;
struct Link* backSentinel;
};
void... |
WeiChienHsu/CS261 | Assignment3/Assignment_3_Instructions_SU18/CLDeque/circularListMain.c | #include "circularList.h"
#include <stdio.h>
int main()
{
struct CircularList* deque = circularListCreate();
circularListAddBack(deque, (TYPE)1);
circularListAddBack(deque, (TYPE)2);
circularListAddBack(deque, (TYPE)3);
circularListAddFront(deque, (TYPE)4);
circularListAddFront(deque, (TYPE)5);
circularListAd... |
WeiChienHsu/CS261 | week5/heap.c | <reponame>WeiChienHsu/CS261
TYPE dyArrayGet(DyArray *heap, int index);
void dyArrayPut(DyArray *heap, int index, int value);
void dyArrayAdd(DyArray *heap, int newValue);
void dyArrayRemoveAt(DyArray *heap, int index);
int dyArraySize(DyArray *heap);
/**************************************************************
* ... |
WeiChienHsu/CS261 | midterm/ArrayBagStack.c | <reponame>WeiChienHsu/CS261<filename>midterm/ArrayBagStack.c
# include "ArrayBagStack.h"
# include <stdio.h>
void initBag(struct arrayBagStack *b) {
b -> count = 0;
}
void addBag(struct arrayBagStack *b, TYPE v) {
b -> data[b -> count] = v;
b -> count ++;
}
int containsBag (struct arrayBagStack * b, TYPE v) {... |
WeiChienHsu/CS261 | Assignment3/Assignment_3_Instructions_SU18/LLDeque/linkedListMain.c | #include "linkedList.h"
#include <stdio.h>
int main(){
struct LinkedList* l = linkedListCreate();
linkedListAddFront(l, (TYPE)1);
linkedListAddBack(l, (TYPE)2);
linkedListAddBack(l, (TYPE)3);
linkedListAddFront(l, (TYPE)4);
linkedListAddFront(l, (TYPE)5);
linkedListAddBack(l, (TYPE)6);
linkedListPr... |
WeiChienHsu/CS261 | final/HashTable.c | <reponame>WeiChienHsu/CS261<filename>final/HashTable.c<gh_stars>1-10
struct openHashTable {
TYPE **table; /* Points to pointer stored in the array */
int tableSize;
int count;
}
void initOpenHashTable(struct openHashTable *ht, int size) {
ht -> table = (TYPE **) malloc(size * sizeof(TYPE *));
ht -> tableSize... |
WeiChienHsu/CS261 | Assignment3/Assignment_3_Instructions_SU18/CLDeque/circularList.h | #ifndef CIRCULAR_LIST_H
#define CIRCULAR_LIST_H
#ifndef TYPE
#define TYPE double
#endif
#ifndef LT
#define LT(A, B) ((A) < (B))
#endif
#ifndef EQ
#define EQ(A, B) ((A) == (B))
#endif
struct CircularList;
struct CircularList* circularListCreate();
void circularListDestroy(struct CircularList* list);
void circularLi... |
WeiChienHsu/CS261 | midterm/LinkedList.h | <gh_stars>1-10
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
#ifndef TYPE
#define TYPE int
#endif
#ifndef LT
#define LT(A, B) ((A) < (B))
#endif
#ifndef EQ
#define EQ(A, B) ((A) == (B))
#endif
struct LinkedList;
struct LinkedList* linkedListCreate();
void linkedListDestroy(struct LinkedList* list);
void linkedListPr... |
WeiChienHsu/CS261 | midterm/DynArrDeque.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
struct deque {
int *data;
int capacity;
int size;
int begin;
};
void dequeInit(struct deque *d, int initCapacity) {
d -> size = 0;
d -> capacity = initCapacity;
d -> data = (int *) malloc(initCapacity * sizeof(int));
d -> begin = 0;
assert(d... |
WeiChienHsu/CS261 | midterm/ArrayBagStack.h | <gh_stars>1-10
# ifndef ArrayBagStack
# define ArrayBagStack
# define MAX_SIZE 100
# define TYPE int
# define EQ(a, b) (a == b)
struct arrayBagStack {
TYPE data [MAX_SIZE];
int count;
};
/* Interface for Bag */
void initBag (struct arrayBagStack * b);
void addBag (struct arrayBagStack * b, TYPE v);
int containsB... |
WeiChienHsu/CS261 | Assignment4/Assignment_4_Files/bst.c | /*
* Name: <NAME>
* Date: 07/16/18
* File: bst.c
* Implementation of the binary search tree data structure.
*/
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include "bst.h"
#include "structs.h"
struct Node {
TYPE val;
struct Node *left;
struct Node *rig... |
WeiChienHsu/CS261 | final/BST.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
struct Node {
int val;
struct Node *right;
struct Node *left;
}
struct BSTree {
struct Node *root;
int cnt;
}
void initBSTree(struct BSTree * tree) {
tree -> root = NULL;
tree -> cnt = 0;
}
void addBSTree(struct BSTree *tree, int value) {
... |
WeiChienHsu/CS261 | Assignment1/Q2.c | /* CS261- Assignment 1 - Q.2*/
/* Name:
* Date:
* Solution description:
* 1) The function int foo(int *a, int *b, int c) should perform the following computations :
* - Swap the addresses of the integers pointed to by a and b
* (not the values of the integers pointed to by a and b).
* - Decrement the value of c.... |
WeiChienHsu/CS261 | Assignment1/Q1.c | /* CS261- Assignment 1 - Q.1*/
/* Name: <NAME>
* Date: 07/01/18
* Solution description:
* 1. Write a function struct student* allocate () that allocates memory for
* ten students and returns the pointer.
*
* 2. Write a function void generate (struct student* students) that generates random
* IDs and scores fo... |
WeiChienHsu/CS261 | final/AVLTree.c | <reponame>WeiChienHsu/CS261
struct AVLnode {
int value;
struct AVLnode *left;
struct AVLnode *right;
int height;
};
int _h(struct AVLnode *current) {
if(current == NULL) return -1;
return current -> height;
}
void _setHeight(struct AVLnode *current) {
int l_height = h(current -> left);
int r_height = ... |
WeiChienHsu/CS261 | Assignment5/Programming_Assignment5_skeleton_files_SU18/hashMap.c | <filename>Assignment5/Programming_Assignment5_skeleton_files_SU18/hashMap.c<gh_stars>1-10
/*
* CS 261 Data Structures
* Assignment 5
* Name: <NAME>
* Date: 7/31/2018
*/
#include "hashMap.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <ctype.h>
int hashFunction1(const c... |
WeiChienHsu/CS261 | Assignment1/Q0.c | /* CS261- Assignment 1 - Q. 0*/
/* Name: <NAME>
* Date: 07/01/2018
* Solution description:
*
* 1. In the main() function, declare an integer, x. Then assign it to a random integer value in
* the interval [0, 10]. Then print the value and address (using the address of operator) of x.
*
* 2. In fooA(int * iptr) ... |
WeiChienHsu/CS261 | midterm/LinkListStack.c | #include <assert.h>
#include <stdlib.h>
#include <stdio.h>
struct Link {
int value;
struct Link *next;
};
struct LinkedListStack {
struct Link *firstLink;
};
void LinkedListStackInit(struct LinkedListStack *s) {
s -> firstLink = NULL;
}
int LinkedListStackIsEmpty(struct LinkedListStack *s) {
if(s -> first... |
WeiChienHsu/CS261 | Assignment5/Programming_Assignment5_skeleton_files_SU18/hashMap.h | #ifndef HASH_MAP_H
#define HASH_MAP_H
/*
* CS 261 Data Structures
* Assignment 5
*/
#define HASH_FUNCTION hashFunction1
#define MAX_TABLE_LOAD 10
typedef struct HashMap HashMap;
typedef struct HashLink HashLink;
struct HashLink
{
char* key;
int value;
HashLink* next;
};
struct H... |
WeiChienHsu/CS261 | Assignment3/Assignment_3_Instructions_SU18/CLDeque/circularList.c | /* CS261- Assignment 3 Part 2 */
/* Name: <NAME>
* Date: 07/16/2018
* Solution description:
* Circularly Linked List Deque Implementation
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "circularList.h"
// Double link
struct Link
{
TYPE value;
struct Link * next;
struct Link * prev;
};... |
WeiChienHsu/CS261 | Assignment5/Programming_Assignment5_skeleton_files_SU18/main.c | <reponame>WeiChienHsu/CS261
/*
* CS 261 Data Structures
* Assignment 5
* Name: <NAME>
* Date: 8/01/2018
*/
#include "hashMap.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include <assert.h>
#include <ctype.h>
/**
* Allocates a string for the next word in the fi... |
WeiChienHsu/CS261 | midterm/BST.c | <gh_stars>1-10
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
struct Node {
int value;
struct Node *left;
struct Node *right;
};
struct BST {
struct Node* root;
int size;
};
void initBST(struct BST *tree) {
tree -> size = 0;
tree -> root = NULL;
}
/* Search a approcitar position to add the... |
WeiChienHsu/CS261 | Assignment2/assignment2_Skeleton_Code/dynamicArray.c | /* CS261- Assignment 2 */
/* Name: <NAME>
* Date: 07/15/2018
* Solution description:
* Implementation of Dynamic Array *****************************************
* initDynArr: Initialize (including allocation of data array) dynamic array.
* newDynArr: Allocate and initialize dynamic array.
* freeDynArr: D... |
WeiChienHsu/CS261 | midterm/DynArr.c | <reponame>WeiChienHsu/CS261
#include <assert.h>
#include <stdlib.h>
#include "DynArr.h"
struct DynArr
{
TYPE *data; /* pointer to the data array */
int size; /* Number of elements in the array */
int capacity; /* capacity ofthe array */
};
void initDynArr(DynArr *v, int capacity) {
v -> data = malloc(sizeof(T... |
WeiChienHsu/CS261 | week4/AVLTree.c | <reponame>WeiChienHsu/CS261<gh_stars>1-10
struct AVLnode {
TYPE value;
struct AVLnode *left;
struct AVLnode *right;
int height;
};
int _h(struct AVLnode * current){
if (current == 0) return -1;
return current->height;
}
void _setHeight (struct AVLnode * current) {
int lch = h(current->left);
int rch = h(cu... |
bpervan/simple-soc | workspace/HelloWorld_bsp/microblaze_0/libsrc/uart_cntrl_v1_00_a/src/uart_cntrl.c | /*****************************************************************************
* Filename: C:\Users\student\LRI2\SoC/drivers/uart_cntrl_v1_00_a/src/uart_cntrl.c
* Version: 1.00.a
* Description: uart_cntrl Driver Source File
* Date: Thu Mar 27 15:00:41 2014 (by Create and Import Per... |
bpervan/simple-soc | workspace/HelloWorld_bsp/microblaze_0/libsrc/led_axi_ip_v1_00_a/src/led_axi_ip.h | /*****************************************************************************
* Filename: C:\Users\student\LRI2\SoC/drivers/led_axi_ip_v1_00_a/src/led_axi_ip.h
* Version: 1.00.a
* Description: led_axi_ip Driver Header File
* Date: Tue Mar 25 15:35:47 2014 (by Create and Import Per... |
bpervan/simple-soc | workspace/HelloWorld/src/helloworld.c | <filename>workspace/HelloWorld/src/helloworld.c
/*
* Copyright (c) 2009-2012 Xilinx, Inc. All rights reserved.
*
* Xilinx, Inc.
* XILINX IS PROVIDING THIS DESIGN, CODE, OR INFORMATION "AS IS" AS A
* COURTESY TO YOU. BY PROVIDING THIS DESIGN, CODE, OR INFORMATION AS
* ONE POSSIBLE IMPLEMENTATION OF THIS FEATUR... |
bpervan/simple-soc | workspace/HelloWorld_bsp/microblaze_0/libsrc/gpio_v3_01_a/src/xgpio_g.c | <filename>workspace/HelloWorld_bsp/microblaze_0/libsrc/gpio_v3_01_a/src/xgpio_g.c
/*******************************************************************
*
* CAUTION: This file is automatically generated by libgen.
* Version: Xilinx EDK 14.6 EDK_P.68d
* DO NOT EDIT.
*
* Copyright (c) 1995-2012 Xilinx, Inc. All rights re... |
bpervan/simple-soc | workspace/HelloWorld_bsp/microblaze_0/libsrc/led_axi_ip_v1_00_a/src/led_axi_ip.c | <reponame>bpervan/simple-soc
/*****************************************************************************
* Filename: C:\Users\student\LRI2\SoC/drivers/led_axi_ip_v1_00_a/src/led_axi_ip.c
* Version: 1.00.a
* Description: led_axi_ip Driver Source File
* Date: Tue Mar 25 15:35:47 2... |
soloazar/C-to-Rust-Transpiler | sample.c | int main(){
int a=1;
int b=5;
int c=5;
for (int i = 1; i < 11; ++i)
{
c=a+b+c;
}
}
|
incbee/BESplitViewConstraintEnforcer | BESplitViewConstraintEnforcer.h | //
// BESplitViewConstraintEnforcer.h
//
// Copyright (c) 2013 Incredible Bee Ltd. Licensed under the BSD License.
//
#import <Foundation/Foundation.h>
@interface BESplitViewConstraintEnforcer : NSObject <NSSplitViewDelegate> {
NSArray *minimumPaneWidths;
}
#pragma mark Initialization
- (id)initWithMinimumPane... |
MIPS/external-avb | examples/uefi/main.c | /*
* Copyright (C) 2017 The Android Open Source Project
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use, copy,
*... |
MIPS/external-avb | libavb_user/avb_ops_user.c | <filename>libavb_user/avb_ops_user.c
/*
* Copyright (C) 2017 The Android Open Source Project
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without l... |
nirsancho/dispatch | dispatch/poller.h | <reponame>nirsancho/dispatch<filename>dispatch/poller.h
/*
* Poller.h
*
* Created on: 30 Aug 2020
* Author: nirsancho
*/
#pragma once
#include <poll.h>
#include <functional>
#include <vector>
#include <map>
namespace dispatch {
class Poller {
public:
typedef short poll_t;
typedef std::function<void(int... |
nirsancho/dispatch | dispatch/safe_queue.h | /*
* safe_queue.h
*
* Created on: 29 Aug 2020
* Author: nirsancho
*/
#pragma once
#include "poller.h"
#include <queue>
#include <unistd.h> // pipe
#include <fcntl.h>
#include <string>
#include <mutex>
#include <errno.h>
#include <stdexcept>
namespace dispatch {
template<typename T>
class SafeQueue {
pr... |
nirsancho/dispatch | dispatch/dispatch_queue.h | /*
* dispatch_queue.h
*
* Created on: 30 Aug 2020
* Author: nirsancho
*/
#pragma once
#include "safe_queue.h"
#include <functional>
#include <list>
namespace dispatch {
class DisptchQueue {
public:
void registerHandler(Poller &poller) {
poller.registerFd(_queue.getReadFd(), POLLIN,
[this](int fd, ... |
melody5417/METableViewAnimation | Source/METableViewAnimation.h | <gh_stars>0
//
// METableViewAnimation.h
// METableViewAnimation
//
// Created by yiqiwang(王一棋) on 2018/6/13.
// Copyright © 2018年 yiqiwang(王一棋). All rights reserved.
//
#import <UIKit/UIKit.h>
//! Project version number for METableViewAnimation.
FOUNDATION_EXPORT double METableViewAnimationVersionNumber;
//! Pr... |
henrikstorck/Vengine | Vengine/include/Vengine/Camera.h | <filename>Vengine/include/Vengine/Camera.h<gh_stars>0
#pragma once
#include <Vengine/Component.h>
namespace vengine
{
class Camera : public Component
{
public:
Camera();
~Camera();
};
} |
henrikstorck/Vengine | Vengine/include/Vengine/Vector2.h | <reponame>henrikstorck/Vengine
#pragma once
#include <iostream>
class Vector2
{
public:
Vector2(float x, float y);
Vector2();
~Vector2();
friend std::ostream& operator<< (std::ostream& stream, const Vector2& vector)
{
stream << "(" << vector.x_ << ", " << vector.y_ << ")";
return stream;
}
float x();
fl... |
henrikstorck/Vengine | Vengine/include/Vengine/Component.h | <gh_stars>0
#pragma once
#include <iostream>
namespace vengine {
class Component
{
public:
Component();
virtual ~Component();
virtual void update();
virtual void start();
virtual void end();
virtual void render();
};
}
|
henrikstorck/Vengine | Vengine/include/Vengine/Mesh.h | <reponame>henrikstorck/Vengine<filename>Vengine/include/Vengine/Mesh.h
#pragma once
#define GLEW_STATIC
//STD
#include <vector>
//OpenGl
#include <GL\glew.h>
//Internal
#include <Vengine/Shader.h>
class Mesh
{
public:
Mesh();
Mesh(std::vector<GLfloat> vertexData, std::vector<GLuint> indices, Shader shader);
~Me... |
henrikstorck/Vengine | Vengine/include/Vengine/GameObject.h | #pragma once
#include <string>
#include <typeinfo>
#include <iostream>
#include <memory>
#include <vector>
#include <Vengine/Component.h>
namespace vengine {
class GameObject
{
public:
GameObject();
GameObject(std::string nameP);
~GameObject();
std::string name;
//-------------------Frame-Events------... |
henrikstorck/Vengine | Vengine/include/Vengine/Scene.h | #pragma once
#include <vector>
#include <string>
#include <Vengine/GameObject.h>
namespace vengine {
class Scene
{
public:
Scene();
Scene(std::string name);
~Scene();
std::string name;
void update();
void start();
void end();
void render();
GameObject* addGameObject();
GameObject* addGameObje... |
henrikstorck/Vengine | Vengine/include/Vengine/Graphics.h | #pragma once
#define GLEW_STATIC
#include <iostream>
#include <stdio.h>
#include <map>
#include <GL/glew.h>
#include <GL/GLU.h>
#include <GLFW\glfw3.h>
#include <SDL\SDL.h>
#include <Vengine\Scene.h>
#include <Vengine\Mesh.h>
#include <Vengine\Shader.h>
#include <Vengine\Vector3.h>
namespace vengine {
class Grap... |
henrikstorck/Vengine | Vengine/include/Vengine/Shader.h | <filename>Vengine/include/Vengine/Shader.h
#pragma once
#define GLEW_STATIC
#include <GL\glew.h>
#include <string>
#include <iostream>
class Shader
{
public:
Shader();
Shader(char* vertexShader, char* fragmentShader);
~Shader();
void use();
char* vertexSource;
char* fragmentSource;
GLuint shaderProgram;
G... |
henrikstorck/Vengine | Vengine/include/Vengine/Transform.h | #pragma once
#include <Vengine/Component.h>
#include <Vengine/Vector3.h>
namespace vengine {
class Transform : public Component
{
public:
Vector3 position_, scale_;
Transform();
~Transform();
};
} |
ZenithEmber/COMP120-Assignment-1-contract | venv/Include/site/python3.7/pygame/pgcompat.h | <reponame>ZenithEmber/COMP120-Assignment-1-contract<gh_stars>10-100
/* Python 2.x/3.x compitibility tools
*/
#if !defined(PGCOMPAT_H)
#define PGCOMPAT_H
#if PY_MAJOR_VERSION >= 3
#define PY3 1
/* Define some aliases for the removed PyInt_* functions */
#define PyInt_Check(op) PyLong_Check(op)
#define PyInt_FromStr... |
ZenithEmber/COMP120-Assignment-1-contract | venv/Include/site/python3.7/pygame/mask.h | #include <Python.h>
#include "bitmask.h"
#define PYGAMEAPI_MASK_FIRSTSLOT 0
#define PYGAMEAPI_MASK_NUMSLOTS 1
#define PYGAMEAPI_LOCAL_ENTRY "_PYGAME_C_API"
typedef struct {
PyObject_HEAD
bitmask_t *mask;
} pgMaskObject;
#define pgMask_AsBitmap(x) (((pgMaskObject*)x)->mask)
#ifndef PYGAMEAPI_MASK_INTERNAL
#defi... |
ZenithEmber/COMP120-Assignment-1-contract | venv/Include/site/python3.7/pygame/mixer.h | <filename>venv/Include/site/python3.7/pygame/mixer.h
/*
pygame - Python Game Library
Copyright (C) 2000-2001 <NAME>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either... |
ZenithEmber/COMP120-Assignment-1-contract | venv/Include/site/python3.7/pygame/freetype.h | <gh_stars>10-100
/*
pygame - Python Game Library
Copyright (C) 2009 <NAME>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any... |
0x1306a94/SampleCode | TestTableView/TestTableView/CommentListTableView.h | <gh_stars>1-10
//
// CommentListTableView.h
// TestTableView
//
// Created by king on 2020/10/31.
// Copyright © 2020 0x1306a94. All rights reserved.
//
#import <UIKit/UIKit.h>
NS_ASSUME_NONNULL_BEGIN
@interface CommentListTableView : UITableView
@end
NS_ASSUME_NONNULL_END
|
0x1306a94/SampleCode | AVVideoCompositingSample/AVVideoCompositingSample/Video/SSVideoCompositionInstruction.h | <reponame>0x1306a94/SampleCode<filename>AVVideoCompositingSample/AVVideoCompositingSample/Video/SSVideoCompositionInstruction.h<gh_stars>1-10
//
// SSVideoCompositionInstruction.h
// AVVideoCompositingSample
//
// Created by king on 2020/10/25.
// Copyright © 2020 taihe. All rights reserved.
//
#import <AVFoundati... |
0x1306a94/SampleCode | TestTableView/TestTableView/ViewController.h | <gh_stars>1-10
//
// ViewController.h
// TestTableView
//
// Created by king on 2020/8/20.
// Copyright © 2020 0x1306a94. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface ViewController : UIViewController
@end
|
0x1306a94/SampleCode | AVVideoCompositingSample/AVVideoCompositingSample/Video/View/SSVideoPreviewView.h | <filename>AVVideoCompositingSample/AVVideoCompositingSample/Video/View/SSVideoPreviewView.h
//
// SSVideoPreviewView.h
// AVVideoCompositingSample
//
// Created by king on 2020/10/25.
// Copyright © 2020 taihe. All rights reserved.
//
#import <UIKit/UIKit.h>
#import <AVFoundation/AVAnimation.h>
NS_ASSUME_NONNULL... |
0x1306a94/SampleCode | CoreDataSample/CoreDataSample/AddViewController.h | //
// AddViewController.h
// CoreDataSample
//
// Created by king on 2021/4/21.
//
#import <UIKit/UIKit.h>
NS_ASSUME_NONNULL_BEGIN
@interface AddViewController : UIViewController
@end
NS_ASSUME_NONNULL_END
|
0x1306a94/SampleCode | AVVideoCompositingSample/AVVideoCompositingSample/Video/SSVideoOverlayItem.h | <reponame>0x1306a94/SampleCode<filename>AVVideoCompositingSample/AVVideoCompositingSample/Video/SSVideoOverlayItem.h
//
// SSVideoOverlayItem.h
// AVVideoCompositingSample
//
// Created by king on 2020/10/25.
// Copyright © 2020 taihe. All rights reserved.
//
#import <CoreGraphics/CGAffineTransform.h>
#import <Cor... |
0x1306a94/SampleCode | CoreDataSample/CoreDataSample/AppDelegate.h | //
// AppDelegate.h
// CoreDataSample
//
// Created by king on 2021/4/21.
//
#import <UIKit/UIKit.h>
@interface AppDelegate : UIResponder <UIApplicationDelegate>
@property (nonatomic, strong) UIWindow *window;
@end
|
0x1306a94/SampleCode | TableViewCellTextView/TableViewCellTextView/EditerTableViewCell.h | <filename>TableViewCellTextView/TableViewCellTextView/EditerTableViewCell.h
//
// EditerTableViewCell.h
// TableViewCellTextView
//
// Created by king on 2021/6/16.
//
#import <UIKit/UIKit.h>
#import "EditerModel.h"
NS_ASSUME_NONNULL_BEGIN
@protocol EditerTableViewCellDelegate;
@interface EditerTableViewCell : ... |
0x1306a94/SampleCode | TestTableView/TestTableView/CommentListViewController.h | <filename>TestTableView/TestTableView/CommentListViewController.h<gh_stars>1-10
//
// CommentListViewController.h
// TestTableView
//
// Created by king on 2020/10/31.
// Copyright © 2020 0x1306a94. All rights reserved.
//
#import <UIKit/UIKit.h>
NS_ASSUME_NONNULL_BEGIN
@interface CommentListViewController : UIV... |
0x1306a94/SampleCode | AVVideoCompositingSample/AVVideoCompositingSample/Video/Metal/Shader/SSShaderTypes.h | //
// SSShaderTypes.h
// AVVideoCompositingSample
//
// Created by king on 2020/10/25.
// Copyright © 2020 taihe. All rights reserved.
//
#ifndef SSShaderTypes_h
#define SSShaderTypes_h
#include <simd/simd.h>
typedef struct {
vector_float4 position;
vector_float2 textureCoordinate;
} SSVertex;
typedef s... |
0x1306a94/SampleCode | CoreDataSample/CoreDataSample/ViewController.h | <reponame>0x1306a94/SampleCode
//
// ViewController.h
// CoreDataSample
//
// Created by king on 2021/4/21.
//
#import <UIKit/UIKit.h>
@interface ViewController : UIViewController
@end
|
0x1306a94/SampleCode | StayCenterLayout/StayCenterLayout/KKCollectionViewStayCenterLayout.h | //
// KKCollectionViewStayCenterLayout.h
// ShowStart
//
// Created by king on 2021/7/22.
// Copyright © 2021 taihe. All rights reserved.
//
#import <UIKit/UIKit.h>
NS_ASSUME_NONNULL_BEGIN
@interface KKCollectionViewStayCenterLayout : UICollectionViewFlowLayout<NSCopying>
@property (nonatomic, assign) CGPoint la... |
0x1306a94/SampleCode | CoreDataSample/CoreDataSample/DBController.h | <gh_stars>1-10
//
// DBController.h
// CoreDataSample
//
// Created by king on 2021/4/21.
//
#import <Foundation/Foundation.h>
#import <CoreData/CoreData.h>
NS_ASSUME_NONNULL_BEGIN
@interface DBController : NSObject
@property (nonatomic, strong, readonly) NSManagedObjectContext *backgroundContext;
@property (non... |
0x1306a94/SampleCode | AVVideoCompositingSample/AVVideoCompositingSample/ViewController.h | <reponame>0x1306a94/SampleCode<filename>AVVideoCompositingSample/AVVideoCompositingSample/ViewController.h<gh_stars>1-10
//
// ViewController.h
// AVVideoCompositingSample
//
// Created by king on 2020/10/25.
// Copyright © 2020 taihe. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface ViewController : UI... |
0x1306a94/SampleCode | TestTableView/TestTableView/AppDelegate.h | <reponame>0x1306a94/SampleCode<filename>TestTableView/TestTableView/AppDelegate.h
//
// AppDelegate.h
// TestTableView
//
// Created by king on 2020/8/20.
// Copyright © 2020 0x1306a94. All rights reserved.
//
#import <UIKit/UIKit.h>
@interface AppDelegate : UIResponder <UIApplicationDelegate>
@end
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.