Displaying 3 results from an estimated 3 matches for "numpoint".
Did you mean:
nupoint
2008 Aug 09
1
Converting nested "for" loops to an "apply" function(s)
...code is:
distances=c(51,65,175,196,197,125,10,56) #distances of 8 houses from the town centre in m
bearings=c(10,8,210,25,74,128,235,335) #bearings of the houses in degrees
xpos=distances*sin(bearings*pi/180) #in sin and cos the argument MUST be in radians
ypos=distances*cos(bearings*pi/180)
numpoints=length(distances)
nnd=rep(sqrt(2*400*400),times=numpoints) #start with the maximum possible distance
for (i in 1:numpoints) {
for (j in 1:numpoints) {
if (i!=j) {
diffx=abs(xpos[i]-xpos[j])
diffy=abs(ypos[i]-ypos[j])
nd=sqrt((diffx^2)+(diffy^2))
if (nd
2020 Jul 26
2
[LAA] RtCheck on pointers of different address spaces.
...ounds comparison have different
// address spaces, assume the values aren't directly comparable, so we can't
// use them for the runtime check. We also have to assume they could
// overlap. In the future there should be metadata for whether address spaces
// are disjoint.
unsigned NumPointers = RtCheck.Pointers.size();
for (unsigned i = 0; i < NumPointers; ++i) {
for (unsigned j = i + 1; j < NumPointers; ++j) {
// Only need to check pointers between two different dependency sets.
if (RtCheck.Pointers[i].DependencySetId ==
RtCheck.Pointers[j].Depen...
2020 Jul 26
2
[LAA] RtCheck on pointers of different address spaces.
...ounds comparison have different
// address spaces, assume the values aren't directly comparable, so we can't
// use them for the runtime check. We also have to assume they could
// overlap. In the future there should be metadata for whether address spaces
// are disjoint.
unsigned NumPointers = RtCheck.Pointers.size();
for (unsigned i = 0; i < NumPointers; ++i) {
for (unsigned j = i + 1; j < NumPointers; ++j) {
// Only need to check pointers between two different dependency sets.
if (RtCheck.Pointers[i].DependencySetId ==
RtCheck.Pointers[j].Depen...