cs2oc

  •        0

cs2oc stands for quot;C-Sharp To Objective-Cquot;. It is a user interface and supporting library for converting applications written in C# with the .NET framework into Objective-C applications.

http://cs2j.sourceforge.net

Tags
Implementation
License
Platform

   




Related Projects

Ecologicsoftware - Proof of concepts


This a projet federation my technical proof of concepts PoCs.

J2ME Pacman


Pacman Game for J2ME enabled cellular phones. A CS 329 - Software Engineering II project for the University of Illinois.

J2swf - Java library for parsing and generating Flash SWF files (aka JavaSWF)


UPDATE - June 16, 2011 - I could not escape Flash. I'm finding that I actually need to resurrect and use the j2swf and (maybe j2avm) tools for a commercial project. I don't want to continue writing Java, so I might start adding new code in Clojure, or lift the whole thing up into a model and use code-generation. I'll write a new post when things are figured out. See http://epistemologicalengineering.blogspot.com/2011/06/update-to-status-of-flash-projects.html J2SWF is the ongoing maintenance and

D900cdr-decoder - CDR (Call Detail Record) Decoder for Siemens D900 MSC


CDR (Call Detail Record) Decoder for Siemens D900 MSCCDR Decoder 2.2 now available: http://code.google.com/p/cdr-decoder/ This project includes the following components: D900Cdr.Decoder.dll (.Net 2.0 library. Contains all functions to work with CDR-files of Siemens D900 MSC)Ability to work with the files versions SR13 (Definition Schema = CS-50) and earlier (Definition Schema = CS-10). All definition schemas describe in a file D900Cdr.Elements.xml. Decoder.exe (.Net 2.0 Windows Forms application

Bibix - Because Papers2, Mendeley, Zotero, Bibdesk, etc, doesn't deliver for die-hard CS uber-re


A project that came out of pure frustration with the current Gui options for article/reference/bibtex management (such as mekentosj's Papers, Papers2, Mendeley, Zotero, Bibdesk, etc). This program is geared toward CS researchers who love latex, bibtex, command lines, (and vim, not emacs ;-) j/k emacs is also cool). Key features that other tools cant do well: Import massive database of bibtex Supports 10s of thousands of articles in the database. Elegant and snappy cmd line interface. Browse and

Peruvianportalterrestrialtransport - Portal de Empresas de Transporte Terrestre para la Información


Portal de Empresas de transporte PERUVIANTERRESTRIALTRANSPORT , brinda Información detalla de las salidas de los vehículos de diferentes empresas de transporte registradas en dicho portal y que a su vez, permite la selección y compra del pasaje. TECNOLOG�AS UTILIZADAS - SPRING 2.5.3 - IBATIS 2.1.6.589 - JSP 2.0 - XHTML 1.0 - JSTL 1.1.2 - STRUTS 2.0.5 - LOG4J 1.2.14 - JAVAMAIL 1.4 - ITEXT 5.0.2 - AJAXTAGS 1.3 - CRYPTIX 3.2 - JUNIT 4.5 - AXIS 1.4 - JSP:INCLUDE \t - SERVLET 2.5 \t - JQUERY\t \t

Cs373-collatz-jgr397 - Collatz 3n+1


Background: Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs. The Problem: Consider the following algorithm: \t\t input n 2. \t\t print n 3. \t\t if n = 1 then STOP 4. \t\t \t\t if n is odd then 5. \t\t \t\t else 6. \t\t GOTO 2 Given the input 22, the following sequence of numbers will be printed

Hierarchicalbinbuffering - Hierarchical Bin Buffering Library in C++


This is the C++ source code for the paper: Daniel Lemire and Owen Kaser, Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays http://arxiv.org/abs/cs.DS/0610128 This paper includes a survey as well as new methods to precompute polynomial range queries, as they are used in polynomial curve fitting and statistics. Code sample: OlaBuffer<float> ob(2,1); // this is the object which computes the buffers counted_ptr<vector<float> > buffer = ob.computeBuffer(data);// buff

Xiangyu-cs373-collatz - write a program to solve the 3n+1 problem


Background: Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs. The Problem: Consider the following algorithm: 1. input n 2. print n 3. if n = 1 then STOP 4. if n is odd then n = 3n + 1 5. else n = n / 2 6. GOTO 2 Given the input 22, the following sequence of numbers will be printed 22 11 34 17 52

Iniprojectreza1 - ini_project_reza_1


SKdOAEneFyg= a+JRyt1wKEq2x0rie5rin3HsbcaJ7LhYU9qUmQt/cyNx2eBuiFYdPHKC18zuqP86t6+lKQ8qfiX/ gB7eE9x+ttVEE9vvIi/16QMRQMvM9l/MXwieDPdEUy7wbnj2IjhmpdtIqci984wa4PNgUV7GTPjd YbWg3HvGmtH9ULByhxg0bVjSMa2+MNEEwo3beXVOfh7mTGlr0k1jTfCqIprupa9bSm8OBRQsr0Db 3sQzAS6J3Rw0AboUrTNAiWRFhizDEEwgElcusORnhrS/+MycA2VqrXolMW8YPs87xOT9JwB3HZ1W fjUIZF/7eiXbPQ5/vbCxMT8r2u/raC6Rqs5mSSr+g8uRJMNDRSUgJmIwd2o= vRCYvQIMCOo= a+JRyt1wKEq2x0rie5rin3UvSGOhKi4woWgduZfn2omUgzgWXxonFanUqjEF+aLiWTYj/GhX7l/s T17nEQgs1yCwUqO6zbua82b62K/r