서민관 - Revision history

imported>smksyj at 02:48, 13 February 2015

2015-02-13T02:48:54Z

← Older revision		Revision as of 02:48, 13 February 2015
Line 8:		Line 8:
	* 정보통신부		* 정보통신부
	== 내용 ==		== 내용 ==
			"Test String"
	== OMS ==		== OMS ==
			* 못 한 것들
	{\| class="wikitable"		{\| class="wikitable"
	\|-		\|-
Line 21:		Line 23:
	\| [http://zeropage.org/seminar/95651 XML-RPC을 이용한 네이버 블로그 글 올리기]		\| [http://zeropage.org/seminar/95651 XML-RPC을 이용한 네이버 블로그 글 올리기]
	\|}		\|}
	~~"Test String"~~
	== 코드 ==		== 코드 ==
	* Map in C		* Map in C

imported>smksyj at 02:48, 13 February 2015

2015-02-13T02:48:23Z

@@ Line 8: / Line 8: @@
 * 정보통신부
 == 내용 ==
 "Test String"
 == 코드 ==

imported>jereneal20 at 18:56, 26 December 2012

2012-12-26T18:56:17Z

← Older revision		Revision as of 18:56, 26 December 2012
Line 235:		Line 235:
	return 0;		return 0;
	}		}
			----
			* 형한텐 항상 배울게 많네요. 최근 자바로 짜는 프로그램은 개발방식이 형이 하던거랑 꽤나 비슷해진거 같구요. 다음에 간단한 프로젝트 코드레이스라도 해보면 좋을거 같아요. ㅎㅎ 형, 겸손한것도 좋지만 자랑하는 것도 능력이에요. 형의 능력을 뽐내봐요! ㅎㅎㅎ -[[김태진]]
			----
			[[ZeroPagers]]

imported>jereneal20 at 20:14, 23 December 2012

2012-12-23T20:14:23Z

← Older revision		Revision as of 20:14, 23 December 2012
Line 1:		Line 1:
			= 서민관 =
			== 소개 ==
			* 09학번
			* 컴퓨터공학부
			* ZeroPager
			* 공부잘함
			* 취향을 존중해드려야..
			* 정보통신부
	== 내용 ==		== 내용 ==
	"Test String"		"Test String"

imported>smksyj at 19:10, 1 August 2012

2012-08-01T19:10:00Z

← Older revision		Revision as of 19:10, 1 August 2012
Line 202:		Line 202:
	map->put("d", 40);		map->put("d", 40);

			assert(map->contains("c") == TRUE);
			assert(map->contains("d") == TRUE);
			assert(map->get("b") == 20);

	map->remove("c");		map->remove("c");

			assert(map->contains("c") == FALSE);

	map->clear();		map->clear();

imported>smksyj at 19:08, 1 August 2012

2012-08-01T19:08:02Z

← Older revision		Revision as of 19:08, 1 August 2012
Line 196:		Line 196:
	int main() {		int main() {
	Map *map = createMap();		Map *map = createMap();

	map->put("a", 10);		map->put("a", 10);
	map->put("b", 20);		map->put("b", 20);
	map->put("c", 30);		map->put("c", 30);
	map->put("d", 40);		map->put("d", 40);

	map->remove("c");		map->remove("c");

	map->clear();		map->clear();

	assert(map->contains("a") == ~~false~~);		assert(map->contains("a") == FALSE);
	assert(map->contains("b") == ~~false~~);		assert(map->contains("b") == FALSE);
	assert(map->contains("c") == ~~false~~);		assert(map->contains("c") == FALSE);
	assert(map->contains("d") == ~~false~~);		assert(map->contains("d") == FALSE);

	map->put("b", 20);		map->put("b", 20);

imported>smksyj at 19:07, 1 August 2012

2012-08-01T19:07:20Z

← Older revision		Revision as of 19:07, 1 August 2012
Line 9:		Line 9:
	#include <stdlib.h>		#include <stdlib.h>
	#include <string.h>		#include <string.h>

			typedef int BOOL;
			#define TRUE 1
			#define FALSE 0

	typedef struct Map {		typedef struct Map {
	void (put)(char key, int value);		void (put)(char key, int value);
	int (get)(char key);		int (get)(char key);
	~~bool~~ (contains)(char key);		BOOL (contains)(char key);
	void (remove)(char key);		void (remove)(char key);
	void (*clear)();		void (*clear)();
Line 24:		Line 28:
	// To watch details, watch Map.cpp		// To watch details, watch Map.cpp
	void put(char *key, int value);		void put(char *key, int value);
	KeyValuePair get(char key);		int get(char *key);
	~~bool~~ contains(char *key);		BOOL contains(char *key);
	void ~~remove~~(char *key);		void removePairFromMap(char *key);
	void clear();		void clear();
	//*/		//*/

	Map.~~cpp~~		Map.c
	#include "Map.h"		#include "Map.h"

Line 106:		Line 110:
	}		}

	~~bool~~ hasKey(KeyValuePair *head, char key) {		BOOL hasKey(KeyValuePair *head, char key) {
	if ( *head != NULL ) {		if ( *head != NULL ) {
	KeyValuePair temp = head;		KeyValuePair temp = head;
Line 112:		Line 116:
	while ( temp != NULL ) {		while ( temp != NULL ) {
	if ( strcmp(temp->key, key) == 0 ) {		if ( strcmp(temp->key, key) == 0 ) {
	return ~~true~~;		return TRUE;
	}		}

Line 119:		Line 123:
	}		}

	return ~~false~~;		return FALSE;
	}		}

Line 160:		Line 164:
	}		}

	~~bool~~ contains(char *key) {		BOOL contains(char *key) {
	return hasKey(&head, key);		return hasKey(&head, key);
	}		}

	void ~~remove~~(char *key) {		void removePairFromMap(char *key) {
	getPair(&head, key);		getPair(&head, key);
	}		}
Line 179:		Line 183:
	ret->get = get;		ret->get = get;
	ret->contains = contains;		ret->contains = contains;
	ret->remove = ~~remove~~;		ret->remove = removePairFromMap;
	ret->clear = clear;		ret->clear = clear;

	return ret;		return ret;
	}		}
	* main.~~cpp~~
			* main.c
	#include <assert.h>		#include <assert.h>

imported>smksyj at 18:40, 1 August 2012

2012-08-01T18:40:43Z

← Older revision		Revision as of 18:40, 1 August 2012
Line 142:		Line 142:
	}		}

	~~static~~ KeyValuePair *head = NULL; // Real KeyValuePair List Head.		KeyValuePair *head = NULL; // Real KeyValuePair List Head.

	// functions for Map		// functions for Map

imported>smksyj at 18:26, 1 August 2012

2012-08-01T18:26:26Z

← Older revision		Revision as of 18:26, 1 August 2012
Line 183:		Line 183:

	return ret;		return ret;
			}
			* main.cpp
			#include <assert.h>

			#include "Map.h"

			int main() {
			Map *map = createMap();
			map->put("a", 10);
			map->put("b", 20);
			map->put("c", 30);
			map->put("d", 40);

			map->remove("c");

			map->clear();

			assert(map->contains("a") == false);
			assert(map->contains("b") == false);
			assert(map->contains("c") == false);
			assert(map->contains("d") == false);

			map->put("b", 20);

			map->put("b", 30);

			assert(map->get("b") == 20);

			map->clear();

			return 0;
	}		}

imported>smksyj at 18:24, 1 August 2012

2012-08-01T18:24:31Z

← Older revision		Revision as of 18:24, 1 August 2012
Line 142:		Line 142:
	}		}

	static KeyValuePair *head = NULL;		static KeyValuePair *head = NULL; // Real KeyValuePair List Head.

	// functions for Map		// functions for Map