C++ (Cpp) intArray Examples

Programming Language: C++ (Cpp)

Class/Type: intArray

Examples at hotexamples.com: 8

IntArray is a library provided by the C++ language that allows the use of arrays to store and manipulate sets of integers. This package library is standard in C++ and requires no additional installation or package installation.

One example of using IntArray would be to declare an array of integers and manipulate its contents. For example:

#include 
#include 

int main() {
    std::array myArray = {1, 2, 3, 4, 5};

    // Print array
    for (int i = 0; i < myArray.size(); i++) {
        std::cout << myArray[i] << " ";
    }

    // Change value of array element
    myArray[3] = 10;

    // Print changed array
    for (int i = 0; i < myArray.size(); i++) {
        std::cout << myArray[i] << " ";
    }
    
    return 0;
}

In this example, an array called `myArray` is declared using the `std::array` template class provided by C++. The array is initialized with five integer values. A for loop is used to print each value in the array to the console. One of the values in the array is then changed, and the new array is printed again.

Another example of using IntArray would be to perform mathematical operations on arrays of integers. For example:

#include 
#include 

int main() {
    std::array myArray1 = {1, 3, 5, 7, 9};
    std::array myArray2 = {2, 4, 6, 8, 10};

    // Add arrays together
    std::array resultArray = {};
    for (int i = 0; i < myArray1.size(); i++) {
        resultArray[i] = myArray1[i] + myArray2[i];
    }

    // Print result array
    for (int i = 0; i < resultArray.size(); i++) {
        std::cout << resultArray[i] << " ";
    }

    return 0;
}

In this example, two arrays called `myArray1` and `myArray2` are declared and initialized with five integer values each. A third array called `resultArray` is also declared, which will hold the sum of the two input arrays. A for loop is used to add each element in `myArray1` to the corresponding element in `myArray2`, and store the result in `resultArray`. Finally, the contents of `resultArray` are printed to the console. Overall, IntArray is a useful library for working with arrays of integers in C++. As it is a standard part of the C++ language, no additional package installation is required.

C++ (Cpp) intArray - 8 examples found. These are the top rated real world C++ (Cpp) examples of intArray extracted from open source projects. You can rate examples to help us improve the quality of examples.

Frequently Used Methods

Show Hide

initialize(2)

length(2)

at_put(1)

begin(1)

end(1)

Example #1

Show file

File: rewriter.hpp Project: gaoxiaojun/dync

  void init_maps(int length) {
    _cp_map.initialize(length, -1);
    // Choose an initial value large enough that we don't get frequent
    // calls to grow().
    _cp_cache_map.initialize(length/2);
    // Also cache resolved objects, in another different cache.
    _reference_map.initialize(length, -1);
    _resolved_references_map.initialize(length/2);
    _invokedynamic_references_map.initialize(length/2);
    _resolved_reference_limit = -1;
    _first_iteration_cp_cache_limit = -1;

    // invokedynamic specific fields
    _invokedynamic_cp_cache_map.initialize(length/4);
    _patch_invokedynamic_bcps = new GrowableArray<address>(length/4);
    _patch_invokedynamic_refs = new GrowableArray<int>(length/4);
  }

Example #2

Show file

File: rewriter.hpp Project: AllenWeb/jdk7u-hotspot

 int add_cp_cache_entry(int cp_index) {
   assert((cp_index & _secondary_entry_tag) == 0, "bad tag");
   assert(_cp_map[cp_index] == -1, "not twice on same cp_index");
   int cache_index = _cp_cache_map.append(cp_index);
   _cp_map.at_put(cp_index, cache_index);
   assert(cp_entry_to_cp_cache(cp_index) == cache_index, "");
   return cache_index;
 }

Example #3

Show file

File: main.cpp Project: robbywalker/ca-phf-research

void main(void) {
	int iteration = 0;

	intArray::const_iterator it;

	cur[1] = 1;	

	do {
		for ( it = cur.begin(); it != cur.end(); it++ ) {
			last[it->first] = it->second;
		}

		for ( it = last.begin(); it != last.end(); it++ ) {
			if ( it->second != 0 ) {
				cur[ it->first ]++;				
				cur[ it->second ]++;
			}			
		}

		if ( (iteration % 100) == 0 ) {
			printf("%d\n", iteration);
		}

	} while ( ++iteration < 1000 );

	for ( it = cur.begin(); it != cur.end(); it++ ) {
		if ( it->second != 0 ) {
			printf("<%d %d>, ", it->second, it->first);
		}
	}
}

Example #4

Show file

File: cpCacheOop.cpp Project: sxhao/codenameone-avian

void constantPoolCacheOopDesc::initialize(intArray& inverse_index_map) {
  assert(inverse_index_map.length() == length(), "inverse index map must have same length as cache");
  for (int i = 0; i < length(); i++) {
    ConstantPoolCacheEntry* e = entry_at(i);
    int original_index = inverse_index_map[i];
    if ((original_index & Rewriter::_secondary_entry_tag) != 0) {
      int main_index = (original_index - Rewriter::_secondary_entry_tag);
      assert(!entry_at(main_index)->is_secondary_entry(), "valid main index");
      e->initialize_secondary_entry(main_index);
    } else {
      e->initialize_entry(original_index);
    }
    assert(entry_at(i) == e, "sanity");
  }
}

Example #5

Show file

File: cpCacheOop.cpp Project: subxiang/jdk-source-code

void constantPoolCacheOopDesc::initialize(intArray& inverse_index_map) {
  assert(inverse_index_map.length() == length(), "inverse index map must have same length as cache");
  for (int i = 0; i < length(); i++) entry_at(i)->set_initial_state(inverse_index_map[i]);
}

Example #6

Show file

File: rewriter.hpp Project: gaoxiaojun/dync

 bool has_cp_cache(int i) { return (uint)i < (uint)_cp_map.length() && _cp_map[i] >= 0; }

Example #7

Show file

File: rewriter.hpp Project: gaoxiaojun/dync

 bool has_entry_in_resolved_references(int cp_index) const {
   return (uint)cp_index < (uint)_reference_map.length() && _reference_map[cp_index] >= 0;
 }

Example #8

Show file

File: rewriter.hpp Project: AllenWeb/jdk7u-hotspot

 void init_cp_map(int length) {
   _cp_map.initialize(length, -1);
   // Choose an initial value large enough that we don't get frequent
   // calls to grow().
   _cp_cache_map.initialize(length / 2);
 }